2/3 Flashcards
(8 cards)
1
Q
Class
A
Combo of data structures and algorithms
2
Q
Tree Traversal
A
Visit/process each data item only once.
3
Q
Depth First Traversals
A
Preorder, in-order, post-order
4
Q
Breadth First
A
Level order
5
Q
Pre-order Traversal
A
Root, left, right
Root node is always processed first, rightmost node is always processed last.
6
Q
In-order Traversal
A
Left, root, right
Leftmost node is always processed first
Rightmost node is always processed last
7
Q
Post-order Traversal
A
Left, right, root
Leftmost node is always processed first
Root note is always processed last
8
Q
Level-order Traversal
A
Traverse top/down and left to right
