+1 vote
in Data Structures & Algorithms I by (110k points)
How many orders of traversal are applicable to a binary tree (In General)?

(a) 1

(b) 4

(c) 2

(d) 3

The question is from Binary Trees in section Binary Trees of Data Structures & Algorithms I

I had been asked this question in an interview for internship.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (d) 3

To explain: The three orders of traversal that can be applied to a binary tree are in-order, pre-order and post order traversal.

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.