Starting data structure notes.
Tree traversal, I usually get these ones mixed up.
Postorder:
callChildren
visit
calls the postorder function on each of the children first, then visits the current node.
Basically causes the lower children to get called first.
Preorder:
visit
callChildren
Simply the opposite of the above.
InOrder:
callLeft
visit
callRight
Only works on binary trees.
-----
This probably won't be useful for anyone else. I'm going to write these up for myself.
I'm basically making a set of notes for myself to review.
Object Oriented
Next ones will be much more detailed.
Up next for data structures:
-Heaps
-Hash tables
-search trees
-sets
-possibly strings (pattern matching and text compression)
-graphs
After data structures I am not sure what I'll do. A few things on my mind.
-databases
-artificial intelligence
-algorithms
-graphics
-security
A few things also on my mind, but further down:
-operating systems
-compilers
-computer organization
Tree traversal, I usually get these ones mixed up.
Postorder:
callChildren
visit
calls the postorder function on each of the children first, then visits the current node.
Basically causes the lower children to get called first.
Preorder:
visit
callChildren
Simply the opposite of the above.
InOrder:
callLeft
visit
callRight
Only works on binary trees.
-----
This probably won't be useful for anyone else. I'm going to write these up for myself.
I'm basically making a set of notes for myself to review.
Object Oriented
Next ones will be much more detailed.
Up next for data structures:
-Heaps
-Hash tables
-search trees
-sets
-possibly strings (pattern matching and text compression)
-graphs
After data structures I am not sure what I'll do. A few things on my mind.
-databases
-artificial intelligence
-algorithms
-graphics
-security
A few things also on my mind, but further down:
-operating systems
-compilers
-computer organization