Trees and Binary Trees Questions and Answers

Q: The post-order and in-order traversal of a Binary tree generates the same output. Then the tree is :

The tree is left skewed.Inorder visits left subtree, node, right subtree; postorder visits left subtree, right subtree, node. The two orders agree only if no node has a right subtree, because then both reduce to 'left subtree, then node'. A binary tree in which every node has only a left child is left skewed.In a right-skewed tree the inorder sequence runs from root to leaf and postorder from leaf to root, the reverse of each other. Any balanced tree with two or more levels has right children, so its orders differ.

Q: What is the height of a binary tree with 7 nodes ?

The key gives 3.Seven nodes fill a complete binary tree exactly: 1 node at the root, 2 on the next level and 4 on the last. That is 3 levels, and counting levels, the height is 3, which is how the key reads the question.\[ 1 + 2 + 4 = 7 \]Counting edges instead, the same tree has height 2, which is option C, and a skewed 7-node tree would be taller still. The paper states neither a convention nor the shape of the tree, so the item is loose. The key gives A, so it is kept; note that textbooks that define height as the number of edges on the longest path give 2 for the complete tree. Option D, 7, is only the height of a degenerate chain counted in nodes, and 4 fits no 7-node complete tree.

Q: What is the maximum number of nodes at level 'L' in a binary tree ?

The maximum number of nodes at level L is \(2^{L}\), counting the root as level 0.Each node has at most two children, so each level can hold at most twice as many nodes as the one above: 1 at level 0, 2 at level 1, 4 at level 2, and \(2^{L}\) at level L.Some books number the root as level 1, and with that convention the same count is written \(2^{L-1}\). The key follows the root-at-level-0 convention. \(2^{L} - 1\) is a different quantity, the total number of nodes in a full tree of L levels, and \(L^{2}\) grows far too slowly.

Q: Which tree traversal visits root first, then left, then right ?

Root first, then left, then right is preorder traversal.The three depth-first traversals of a binary tree are named after where the root is visited. Preorder visits the root before its subtrees (root, left, right), inorder visits it between them (left, root, right), and postorder visits it after them (left, right, root).Level order is breadth-first: it visits the nodes level by level from the top, left to right, using a queue, rather than following the root-left-right pattern.

Q: A complete binary tree with 4 levels has a maximum of how many nodes ?

A binary tree with 4 levels has at most 15 nodes.Level i (counting the root as level 1) can hold at most \(2^{i-1}\) nodes, so a full tree of h levels has:\[ \begin{aligned} N &= 1 + 2 + 4 + 8 \\ &= 2^{4} - 1 = 15 \end{aligned} \]16 is \(2^{4}\), forgetting the minus one. 31 is the count for 5 levels, and 14 falls one short.

Q: In a binomial tree what is the order of the second sub-tree of the root (from the height) ?

The key's answer is 1.A binomial tree Bk has a root whose sub-trees are themselves binomial trees Bk-1, Bk-2, ..., B1, B0. Read from the lowest height upward, the sub-trees are B0, B1, B2 and so on, so the second one is B1, of order 1, in any binomial tree of order 2 or more.Counted from the tallest sub-tree instead, the second is Bk-2, whose order depends on k, so the question has a single answer only on the first reading. Order 0 is the first sub-tree on that reading, and 2 is the third.

11.

The post-order and in-order traversal of a Binary tree generates the same output. Then the tree is :

A.Nearly balanced
B.Completely balanced
C.Right skewed
D.Left skewed

Exam Year(s)

MH SET - 2025, SET Exam - 2025,

Answer: D

The tree is left skewed.

Inorder visits left subtree, node, right subtree; postorder visits left subtree, right subtree, node. The two orders agree only if no node has a right subtree, because then both reduce to 'left subtree, then node'. A binary tree in which every node has only a left child is left skewed.

In a right-skewed tree the inorder sequence runs from root to leaf and postorder from leaf to root, the reverse of each other. Any balanced tree with two or more levels has right children, so its orders differ.

Discuss in Forum

12.

What is the height of a binary tree with 7 nodes ?

Exam Year(s)

Tripura Public Service Commission - 2025,

Answer: A

The key gives 3.

Seven nodes fill a complete binary tree exactly: 1 node at the root, 2 on the next level and 4 on the last. That is 3 levels, and counting levels, the height is 3, which is how the key reads the question.

\[ 1 + 2 + 4 = 7 \]

Counting edges instead, the same tree has height 2, which is option C, and a skewed 7-node tree would be taller still. The paper states neither a convention nor the shape of the tree, so the item is loose. The key gives A, so it is kept; note that textbooks that define height as the number of edges on the longest path give 2 for the complete tree. Option D, 7, is only the height of a degenerate chain counted in nodes, and 4 fits no 7-node complete tree.

Discuss in Forum

13.

What is the maximum number of nodes at level 'L' in a binary tree ?

A.\(2^{L}\)
B.\(2^{(L - 1)}\)
C.\(2^{L} - 1\)
D.\(L^{2}\)

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: A

The maximum number of nodes at level L is \(2^{L}\), counting the root as level 0.

Each node has at most two children, so each level can hold at most twice as many nodes as the one above: 1 at level 0, 2 at level 1, 4 at level 2, and \(2^{L}\) at level L.

Some books number the root as level 1, and with that convention the same count is written \(2^{L-1}\). The key follows the root-at-level-0 convention. \(2^{L} - 1\) is a different quantity, the total number of nodes in a full tree of L levels, and \(L^{2}\) grows far too slowly.

Discuss in Forum

14.

Which tree traversal visits root first, then left, then right ?

A.Inorder
B.Postorder
C.Level order
D.Preorder

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: D

Root first, then left, then right is preorder traversal.

The three depth-first traversals of a binary tree are named after where the root is visited. Preorder visits the root before its subtrees (root, left, right), inorder visits it between them (left, root, right), and postorder visits it after them (left, right, root).

Level order is breadth-first: it visits the nodes level by level from the top, left to right, using a queue, rather than following the root-left-right pattern.

Discuss in Forum

15.

A complete binary tree with 4 levels has a maximum of how many nodes ?

A.15
B.16
C.14
D.31

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: A

A binary tree with 4 levels has at most 15 nodes.

Level i (counting the root as level 1) can hold at most \(2^{i-1}\) nodes, so a full tree of h levels has:

\[ \begin{aligned} N &= 1 + 2 + 4 + 8 \\ &= 2^{4} - 1 = 15 \end{aligned} \]

16 is \(2^{4}\), forgetting the minus one. 31 is the count for 5 levels, and 14 falls one short.

Discuss in Forum

16.

In a binomial tree what is the order of the second sub-tree of the root (from the height) ?

A.2
B.1
C.0
D.None of the above

Exam Year(s)

Tripura Public Service Commission - 2019,

Answer: B

The key's answer is 1.

A binomial tree B_k has a root whose sub-trees are themselves binomial trees B_k-1, B_k-2, ..., B₁, B₀. Read from the lowest height upward, the sub-trees are B₀, B₁, B₂ and so on, so the second one is B₁, of order 1, in any binomial tree of order 2 or more.

Counted from the tallest sub-tree instead, the second is B_k-2, whose order depends on k, so the question has a single answer only on the first reading. Order 0 is the first sub-tree on that reading, and 2 is the third.

Discuss in Forum

Loading…

Topics

Other Subjects

Tags: Trees and Binary Trees Questions and Answers || Trees and Binary Trees MCQ Questions and Answers || Trees and Binary Trees GK Questions and Answers || Trees and Binary Trees GK MCQ Questions || Trees and Binary Trees Multiple Choice Questions and Answers || Trees and Binary Trees GK || GK on Trees and Binary Trees || Data Structures and Algorithms Questions and Answers || Data Structures and Algorithms MCQ Questions and Answers || Data Structures and Algorithms GK Questions and Answers || GK on Data Structures and Algorithms

Trees and Binary Trees Questions and Answers

Topics

Other Subjects

About Us

Stay informed about all important Dates & Notifications