Linked Lists WedW15

Madeline Harlow
Mind Map by Madeline Harlow, updated more than 1 year ago
Madeline Harlow
Created by Madeline Harlow almost 5 years ago
69
0

Description

A quick mind map summarizing the ideas associated with linked lists that is progressively adapted as the course continues.

Resource summary

Linked Lists WedW15
1 Composed of nodes
1.1 Nodes contain data
1.2 Nodes contain pointer to nxt node
1.3 typedef struct node{ int data; struct node * next;}NODE;
1.4 Saved in the heap
1.4.1 NODE* p = malloc(sizeof(NODE));
1.4.2 free(p);
1.4.3 assert(p!=NULL);
2 add nodes
2.1 add to front
2.1.1 newNode->next= head; head = newNode;
2.2 add to back
2.3 add to middle
3 delete nodes
3.1 delete front
3.2 delete middle
3.3 delete last
3.4 delete all
4 traverse a list
4.1 modify/set values
4.2 append (see add node)
4.3 counting nodes (length)
4.4 search for value
4.5 sum, average, math
4.6 # of occurances
5 Always starts with head
5.1 head == NULL the list is empty
5.2 head != NULL list is occupied
6 Always end with NULL
6.1 if(p->next == NULL) p is point to the last node (p is tail)
6.1.1 found the end of the list (see append)
6.2 if(p == NULL)
6.2.1 traverse through whole list
Show full summary Hide full summary

Similar

Programming in C MindMap
Tejas Rao
MIND MAP 1
vsolakis
C programming # 001
satya.panda
History of Medicine: Ancient Ideas
James McConnell
GCSE Biology Quiz
joannaherbert
MODE, MEDIAN, MEAN, AND RANGE
Elliot O'Leary
AS Biology- OCR- Module 1 Cells Specification Analysis and Notes
Laura Perry
AQA - English Language Unit 1
Alice Love
Physics P1
themomentisover
1PR101 1.test - 8. část
Nikola Truong
1PR101 2.test - Část 19.
Nikola Truong