Linked List Summary
Linked lists are a sequence of elements where each element linked to the next element. A linked list can contain all types of data. The advantages of using linked lists are that insertion and deletions of elements are very fast. There are three kinds of linked list.
Circular single linked list can send nodes to another link field using pointers. circular single linked list does not have NULL values. The last node is linked to the first node.
Doubly linked list is like a singly linked list but each element also link to the previous element.
Circular doubly linked list is like doubly linked list but circular doubly linked list is looped at the end just like circular single linked list where the last node is linked to the first node.
No comments:
Post a Comment