Editing Linked list
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 20: | Line 20: | ||
===Doubly linked lists=== | ===Doubly linked lists=== | ||
In some lists, each node also contains a link that points to the ''previous'' node (except possibly the first node, which may or may not point back to the head node). Doubly linked lists may be efficiently traversed both forward and backward (if the head node contains a pointer to the last element), and allow ''erase'' to be implemented efficiently without foreknowledge of the address of the node preceding the one we wish to erase. | In some lists, each node also contains a link that points to the ''previous'' node (except possibly the first node, which may or may not point back to the head node). Doubly linked lists may be efficiently traversed both forward and backward (if the head node contains a pointer to the last element), and allow ''erase'' to be implemented efficiently without foreknowledge of the address of the node preceding the one we wish to erase. | ||
− | |||
− |