| Share this post! | Vote this! |
|
A linked list in which the last node points to the first node is
called a circular linked list. —Circular linked lists avoid the use of
null references in their nodes. —Can be useful for certain algorithms
like playing video/audio files repeatedly and ALT + TAB in Windows.
—Successor of tail node is the head node. In doubly-linked list, predecessor of head node is the tail node. —Insertions and deletions into a circular linked list follow the same logic patterns used in a singly linked list except that the last node must always point to the first node. —Therefore, when inserting or deleting the last node, in addition to updating the tail pointer, we must also point the link field of the new last node to the first node. more...
—Successor of tail node is the head node. In doubly-linked list, predecessor of head node is the tail node. —Insertions and deletions into a circular linked list follow the same logic patterns used in a singly linked list except that the last node must always point to the first node. —Therefore, when inserting or deleting the last node, in addition to updating the tail pointer, we must also point the link field of the new last node to the first node. more...
0 comments:
Post a Comment