Tree-traversals

Question 1
The inorder traversal of the following tree is:
A
2 3 4 6 7 13 15 17 18 18 20
B
20 18 18 17 15 13 7 6 4 3 2
C
15 13 20 4 7 1718 2 3 6 18
D
2 4 3 13 7 6 15 17 20 18 18
       Data-Structures       Tree-traversals       UGC NET CS 2015 Dec- paper-2
Question 1 Explanation: 
Inorder traversal through Left, Root and Right. Inorder yield procedure given below.
There is 1 question to complete.
PHP Code Snippets Powered By : XYZScripts.com