Please enable JavaScript.
Coggle requires JavaScript to display documents.
DOUBLY LINKED LIST - Coggle Diagram
DOUBLY LINKED LIST
Always end with NULL
if(p==NULL)
traverse through whole list
if(p->next==NULL)p is point to the last node(p is tall)
found the end of the list
traverse a list
Modify/Set Number
Append(see add node)
search for value
counting nodes
Sum, average, math
add nodes
Add to front
newNode->next=start;
start->prev = newNode;
START=newNode
add to back
add to middle
delete nodes
delete all
delete front
delete middle
delete last
composed of nodes
Saved in the head
NODE*p=Malloc(sizeof(NODE))
assert(p!=NULL);
free(p);
Nodes contain data
Nodes Contain pointer to next node as well as pointer to prevous
types struct node{struct node
prev; int data; struct node
next;}NODE;
Always start with head
head==NULL the list is Overflow
head!=NULL list is occupied