Please enable JavaScript.
Coggle requires JavaScript to display documents.
data structure full course map - Coggle Diagram
data structure full course map
foundations
oop pillars
abstraction simple interface
inheritance polymorphism
adt design
python classes
class object self
init constructor
super inheritance lab
algorithm basics
time space cost
big o growth rate
recursion base case
linear structures
array list
referential array
index access o1
append amortized o1
linked list
node data next
traversal on
head insert o1
stack queue deque
stack lifo
queue fifo
deque both ends
list labs
caesar ord chr
linked node class
insert delete pointers
table hash
set concepts
operations contract
unique unordered
add remove contains
union intersection
dictionary map
get update delete
hash table
collision chaining
average lookup o1
table labs
md5 hash file io
word count counter
two d rows columns
trees bst
tree concepts
root leaf sibling
depth height
parent child hierarchy
traversals
dfs preorder
postorder
sort edges by weight
bfs level order
binary tree
left right child
linked nodes
array index mapping
bst operations
left less right greater
search insert delete
balanced ologn skewed on
advanced trees graph
mst basics
spanning tree v minus one
prim algorithm
choose min crossing edge
mstset avoids cycles
kruskal algorithm
union find cycle check
avl heap
balance factor le one
comparison choice
access update
grow from start
array fast access
linked fast insert
deque front back
lookup membership
avl rotations ll lr rr rl
heap priority queue
set membership
dict key lookup
hash average o1
hierarchy priority
weighted connected graph
minimum total weight
tree hierarchy
bst ordered search
heap priority only
selection rules
encapsulation hides data
applications reflection
real world uses
hash function
operation frequency
memory tradeoff
data scale
file system tree
contacts dictionary
schedule priority queue
lab portfolio
class list hash tree
prim kruskal avl heap
from concept to code
coding mindset
what not how
compare big o
test edge cases
choose structure first
final reflection
key value pairs
adt clarifies design
tradeoff awareness
python practice helps