December2015 Cs Q38
0. The inorder traversal of the following tree is:
- Option : D
- Explanation : In inorder traversal first we traverse left node then root node and then right node: In the following tree
we first go to the leftmost node then its root after that right i.e. 2 4 3 13 7 6 15 17 20 18 18. In rest of the option inorder property is violating. So, option (D) is correct.
