Description: 1. Seek a two-way circular list the length of the
2. In a two-way circular linked list insert an element in the specified location
3. For a given two-way loop in a linked list node element of the value of e, requires that the data y is inserted into the front element e
4. For a given two-way loop in a linked list node element of the value of e, requires that the data y is inserted into the back of element e
5. For a given two-way loop in a linked list node element of the value of e, requires that the data y is inserted into the back of element e
6. Remove the two-way circular linked list of elements in the specified location
7. For a given two-way loop in a linked list node element of the value of e, request to delete the corresponding nodes
8. For a given two-way loop in a linked list node element of the value of e, to delete the corresponding node immediate precursor
9. For a given two-way loop in a linked list node element of the value of e, to delete the correspondi
- [datast] - NOTE: array.h :secure array,linkedlist.h
File list (Check if you may need any files):
DLink\2-11.cpp
DLink
Download