Week 8 Workshop 5 - continued Hierarchical Data Structures Part 1

Waht is depth first traversal?

proceeds along a path from the root through one child to the most distant descendant of that first child before processing the second child. Implementation uses a stack.

What is breadth first traversal?

proceeds horizontally from the root to all of its children then to its children’s children and so on... Implementation uses a queue.

what are the 6 possible types of travesal?

VLR, VRL, LVR, RVL, LRV, RLV

what are the 3 most common types of traversal?

VLR Preorder, LVR inOrder, LRV PostOrder

Waht is preorder traversal?

VLR Vist the root node then the left and finaly the right

what is inorder traversal

LVR visit the lft node then the root node then the right node

what is post order traversal?

LRV vist the leftnode then the right then the root

what does VLR stand for?

V: Visit the node L: Traverse the Left subtree R: Traverse the Right subtree