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
1577297
Linked Lists
Description
Mind Map on Linked Lists, created by Madeline Harlow on 11/03/2014.
Mind Map by
Madeline Harlow
, updated more than 1 year ago
More
Less
Created by
Madeline Harlow
over 10 years ago
43
1
0
Resource summary
Linked Lists
Variable size
Change in real time (on run time)
composed of nodes
structs
contains the data types you want
one element is a pointer to the next node
Saved in the heap
dynamic memory
malloc
each node individually
Assert
sizeof
free
Each node individually (loop)
ALWAYS started by the head pointer
The first thing you ALWAYS do is declare and initialize the head pointer,
Singly linked
list pointing in one direction
once you go to the next node, you can't get back, UNLESS you keep track of the previous node
have a 'previous' pointer
End of the list is represented by NULL
Always begin by initializing the next pointers to NULL
2 'types' of lists
empty
head == NULL
full or occupied
head == address to a node
3 conditions to check
At the front
At the back
At the middle
List Traversal
For loop
Stop when reach the next=null
Show full summary
Hide full summary
Want to create your own
Mind Maps
for
free
with GoConqr?
Learn more
.
Similar
Linked Lists WedW15
Madeline Harlow
Linked Lists WedW15
Neyavanan v
Linked Lists WedW15
Neyavanan v
Linked Lists WedW15
Neyavanan v
Linked Lists WedW15
Kunall Banerjee
Rounding to decimal places
Ellen Billingham
Chemistry Facts
beth2384
TYPES OF DATA
Elliot O'Leary
Maths
Emmet McDonald
Japanese Hiragana
pangcaberte
Language Techniques
Anna Wolski
Browse Library