In a binary search tree, which of the following traversals would print the numbers in the ascending order?
(a) Level-order traversal
(b) Pre-order traversal
(c) Post-order traversal
(d) In-order traversal
I would like to ask this question from Inorder Traversal topic in section Binary Trees of Data Structures & Algorithms I
I had been asked this question by my school principal while I was bunking the class.