On this page, all questions relate to the binary search tree shown below. c)Give

Question

On this page, all questions relate to the binary search tree shown below.

c)Given the binary search tree shown above, list the order in which values would be displayed during a preorder traversal of the tree.

d)Given the binary search tree shown above, list the order in which values would be displayed during an inorder traversal of the tree.

e)Given the binary search tree shown above, list the order in which values would be displayed during a postorder traversal of the tree.

Explanation / Answer

c)Ans)
22 9 7 1 15 12 35 27 30 42 37 65
Explanation :- In preorder traversal , we will take the value of root node first then left node and right node in the last. So as we traverse through the given tree using root,left and right formula , then we will get the result.

d)Ans)
1 7 9 12 15 22 27 30 35 37 42 65
Explanation :- Inorder traversal formula is left,root and right. This traversal will give us asending order of the nodes in the tree.

e)Ans)
1 7 12 15 9 30 27 37 65 42 35 22
Explanation :- Postorder traversal formula is left,right and root. This means we will print all the left and right children in the last we will print the root element.

Related Questions

Navigate

• Browse (All)
• Browse O
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.