Computer Science, asked by magesh8754, 9 months ago

5
The preorder traversal sequence of a
BST is 30,20,10,15,25,23,39,35,42,
Find out the postorder order traversal.
*
(1 Point)​

Answers

Answered by tanishkbankar
1

Answer:

The other traversal sequence can be either Preorder or Postorder. We know that the Inorder traversal of Binary Search Tree is always in ascending order so the Inorder Traversal would be the ascending order of given Preorder traversal i.e 10, 15, 20, 23, 25, 30, 35, 39, 42.

Similar questions