Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Tree Tree Traversal
Arrange the following steps of the Inorder Traversal of Binary Tree in the correct order.
A. Visit the Left subtree
B. Visit the Root node
C. Visit the Right subtree
D. Start traversing by visiting the nodes in rooted tree
E. Repeat the above three steps.
Choose the correct answer from the options given below:
1
A, B, C, D, E
2
E, A, B, C, D
3
D, A, B, C, E
4
D, A, E, B, C