null
US
Sign In
Sign Up for Free
Sign Up
We have detected that Javascript is not enabled in your browser. The dynamic nature of our site means that Javascript must be enabled to function properly. Please read our
terms and conditions
for more information.
Next up
Copy and Edit
You need to log in to complete this action!
Register for Free
2171787
Linked Lists WedW15
Description
A quick mind map summarizing the ideas associated with linked lists that is progressively adapted as the course continues.
No tags specified
c programming
linked lists
sysc 2006
carleton university
Mind Map by
Madeline Harlow
, updated more than 1 year ago
More
Less
Created by
Madeline Harlow
over 9 years ago
416
0
0
Resource summary
Linked Lists WedW15
Composed of nodes
Nodes contain data
Nodes contain pointer to nxt node
typedef struct node{ int data; struct node * next;}NODE;
Saved in the heap
NODE* p = malloc(sizeof(NODE));
free(p);
assert(p!=NULL);
add nodes
add to front
newNode->next= head; head = newNode;
add to back
add to middle
delete nodes
delete front
delete middle
delete last
delete all
traverse a list
modify/set values
append (see add node)
counting nodes (length)
search for value
sum, average, math
# of occurances
Always starts with head
head == NULL the list is empty
head != NULL list is occupied
Always end with NULL
if(p->next == NULL) p is point to the last node (p is tail)
found the end of the list (see append)
if(p == NULL)
traverse through whole list
Show full summary
Hide full summary
Want to create your own
Mind Maps
for
free
with GoConqr?
Learn more
.
Similar
Programming in C MindMap
Tejas Rao
MIND MAP 1
vsolakis
C programming # 001
satya.panda
Cory & Manuel_1
cory.jones2010
Definitions in AS chemistry
Stephen Cole
med chem 2
lola_smily
Mind Map 1_1
n.marment
OCR GCSE History-Paper Two: The Liberal Reforms 1906-14 Poverty to Welfare State NEW FOR 2015!!!
I Turner
Examen II Salesforce Developer
Youssef Ahmani
Core 1.12 Timbers blank test
T Andrews
AAHI_Card set 6 (Terms of movement)
Tafe Teachers SB
Browse Library