+1 vote
in Data Structures & Algorithms I by (110k points)
A full binary tree can be generated using ______

(a) post-order and pre-order traversal

(b) pre-order traversal

(c) post-order traversal

(d) in-order traversal

The origin of the question is Binary Trees in chapter Binary Trees of Data Structures & Algorithms I

The question was posed to me by my school principal while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (a) post-order and pre-order traversal

The explanation is: Every node in a full binary tree has either 0 or 2 children. A binary tree can be generated by two traversals if one of them is in-order. But, we can generate a full binary tree using post-order and pre-order traversals.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.