Binary Tree Traversal Worksheet Form
Binary Tree Traversal Worksheet Form
Given the binary tree diagram below (A is root, B and C are children of A, D and E are children of B, F is right child of C), list the nodes in Inorder traversal.
*
List the nodes in Preorder traversal for the same tree.
*
List the nodes in Postorder traversal for the same tree.
*
List the nodes in Level-order traversal for the same tree.
*
Match the traversal type to its definition.
*
Rows
Definition
Preorder
Visit root, then left subtree, then right subtree
Visit left subtree, then root, then right subtree
Visit left subtree, then right subtree, then root
Visit nodes level by level from top to bottom
Inorder
Visit root, then left subtree, then right subtree
Visit left subtree, then root, then right subtree
Visit left subtree, then right subtree, then root
Visit nodes level by level from top to bottom
Postorder
Visit root, then left subtree, then right subtree
Visit left subtree, then root, then right subtree
Visit left subtree, then right subtree, then root
Visit nodes level by level from top to bottom
Level-order
Visit root, then left subtree, then right subtree
Visit left subtree, then root, then right subtree
Visit left subtree, then right subtree, then root
Visit nodes level by level from top to bottom
Which traversal would you use to get a sorted sequence from a binary search tree?
*
Inorder
Preorder
Postorder
Level-order
Rate your confidence in performing binary tree traversals.
*
1
2
3
4
5
How difficult do you find binary tree traversal algorithms?
*
1
2
3
4
5
Select all traversal types that visit every node exactly once.
*
Inorder
Preorder
Postorder
Level-order
Explain a scenario where Level-order traversal is preferred over other traversals.
*
Which traversal is best for deleting a binary tree node by node?
*
Inorder
Preorder
Postorder
Level-order
Submit Worksheet
Should be Empty: