Binary Trees and Traversals - C++ for Competitive Exams

Binary Trees and Traversals - Implementations in C++ - Competitive Exam Level

Q. What is the output of the following C++ code for a binary tree with root value 1, left child 2, and right child 3 during pre-order traversal?

Solution

Pre-order traversal visits the root first, then the left subtree, followed by the right subtree, resulting in the output '1 2 3'.

Correct Answer: A — 1 2 3

Q. Which of the following traversal methods can be used to print the nodes of a binary tree level by level?

Solution

Level-order traversal visits nodes level by level, making it suitable for printing nodes in that order.

Correct Answer: D — Level-order

Showing 1 to 2 of 2 (1 Pages)