UGC NET CS 2014 June-paper-2
October 28, 2023Evaluation-System
October 28, 2023GATE 1991
| Question 9 |
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
| 4, 1, 6, 7, 3, 2, 5, 8 |
Question 9 Explanation:
Inorder traversal is
(Left, Root, Right)
So, the order will be
4, 1, 6, 7, 3, 2, 5, 8
(Left, Root, Right)
So, the order will be
4, 1, 6, 7, 3, 2, 5, 8
Correct Answer: A
Question 9 Explanation:
Inorder traversal is
(Left, Root, Right)
So, the order will be
4, 1, 6, 7, 3, 2, 5, 8
(Left, Root, Right)
So, the order will be
4, 1, 6, 7, 3, 2, 5, 8