Consider the following binary tree: A is the root. A has left child B and right child C. B has left child D and right child E. C has a right child F.
Consider the following binary tree:
A is the root. A has left child B and right child C. B has left child D and right child E. C has a right child F.
If an in-order traversal is performed on this tree, what will be the correct order of visiting nodes?
Show answerHide answer
Correct answer: (A) D B E A C F