Question

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.

Answer 1

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.