→ Week 8 Workshop 5 - Continued Hierarchical Data Structures Part 1 →学習を始める /ダウンロードMP3フラッシュカード

学び始める

質問		答え
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

Week 8 Workshop 5 - continued Hierarchical Data Structures Part 1