Binary Trees and Traversals - Exam Prep Problem Set

Binary Trees and Traversals - Implementations in Python - Problem Set

Q. What is the output of the following in-order traversal on the binary tree: 1 (root), 2 (left child), 3 (right child)?

Solution

In-order traversal visits the left child first, then the root, and finally the right child, resulting in the output 2, 1, 3.

Correct Answer: B — 2, 1, 3

Q. What is the result of a post-order traversal on a binary tree with nodes 1 (root), 2 (left), 3 (right)?

Solution

Post-order traversal visits the left child, then the right child, and finally the root, resulting in the output 2, 3, 1.

Correct Answer: B — 2, 3, 1

Showing 1 to 2 of 2 (1 Pages)