Please enable JavaScript.
Coggle requires JavaScript to display documents.
LINKED LIST (Singly Linked List (Inserting a new node (At the end, At a…
LINKED LIST
Singly Linked List
Traversing
Searching for a value
Inserting a new node
At the end
At a given position
At the beginning
Deleting a node
At the end
At the beginning
At a given position
Circular Doubly Linked List
Delete a node
At the beginning
At the end
Insert a node
At the beginning
At the end
Doubly Linked List
Insert a new node
At the end
At the given position
At the beginning
Delete a node
At the end
At the given position
At the beginning
Introduction
Linked Lists versus Arrays
Memory Allocation and De-allocation for a linked list
Basic Terminologies
Circular Linked List
Insert a new node
At the beginning
At the end
Delete a node
At the beginning
At the end
Header Linked List
Multiple Linked List
Applications
Polynomial Representation