It can easily perform insertion, append, deletion operations without reorganization of the entire list because memory allocation is done during run-time but if we want the same operations on an array that needs to allocate fixed memory, its run time will get more expensive. In this way, it forms a chain-like structure. A single node is just the object which contains things like, " data" and a " next" pointer which points to the next node in case of singly and circular linked list, and also " previous" pointer which will point to the previous node in case of a doubly linked list. The linked list is a linear data structure, that has a sequence of continuous nodes. We start with the basics of Linked List and then, move to applications of the different types of Linked List. In this article, we have covered the applications of Linked List, Circular Linked List and Doubly Linked List.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |