Tree-traversal

Question 1

If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______

A
4, 1, 6, 7, 3, 2, 5, 8
AlgorithmsTree-traversalGATE 1991Video-Explanation
Question 1 Explanation: 
Inorder traversal is
(Left, Root, Right)
So, the order will be
4, 1, 6, 7, 3, 2, 5, 8
Question 2

Which one of the following binary trees has its inorder and preorder traversals as BCAD  and ABCD, respectively?

A
B
C
D
AlgorithmsTree-traversalGATE 2004-IT
Question 2 Explanation: 
Inorder traversal is,
Left root right.
Preorder traversal is,
Root left right.
There are 2 questions to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access