Please enable JavaScript.
Coggle requires JavaScript to display documents.
Linked list and memory management - Coggle Diagram
Linked list and memory management
Linked list
Linked list vs Arrays
Node
Classification
Circular Linked list
Doubly Linked list
Insertion at the end
Insertion at any position
insertion at front
delete from front
Singly Linked list
create singly linked list
Operations on a singly linked list
Traversing the list
inserting a node into the list
insertion at front
Insert at end
insert at any position
deleting a node from the list
delete from end
delete from any position
delete from front
searching for an element in the list
copying the list
merging two lists
Representation of linked list in memory
Static representation
Using arrays
Dynamic representation
Self referential structures
implementation
applications
stack as a linked list
advantage
top==head
push
pop