Binary Trees and Traversals - Exam Prep for Students

Binary Trees and Traversals - Implementations in Python - Higher Difficulty Problems

Q. In a binary tree, what does it mean if a node has both left and right children?

Solution

A node with both left and right children is referred to as a full node in the context of binary trees.

Correct Answer: B — It is a full node

Q. What is the result of a postorder traversal on the binary tree with root 1, left child 2, and right child 3?

Solution

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

Correct Answer: B — 2, 3, 1

Q. What is the space complexity of the recursive implementation of inorder traversal?

Solution

The space complexity of the recursive implementation of inorder traversal is O(n) due to the call stack used for recursion.

Correct Answer: B — O(n)

Showing 1 to 3 of 3 (1 Pages)