0 votes 0 votes Post-order traversal of a given binary search tree $T$ produces following sequence of keys: $3,5,7,9,4,17,16,20,18,15,14$. Which one of the following sequences of keys can be the result of an in-order traversal of the tree $T$? $3,4,5,7,9,14,20,18,17,16,15$ $20,18,17,16,15,14,3,4,5,7,9$ $20,18,17,16,15,14,9,7,5,4,3$ $3,4,5,7,9,14,15,16,17,18,20$ Unknown Category ugcnetcse-nov2017-paper2 + – Arjun asked Nov 5, 2017 • retagged May 9, 2021 by soujanyareddy13 Arjun 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes inorder traversal always gives sorted list in BST. therefore option D. 3,4,5,7,9,14,15,16,17,18,20 Debasmita Bhoumik answered Nov 5, 2017 • selected Nov 5, 2017 by Prashant. Debasmita Bhoumik comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option D since given tree is BST Inorder Traversal of BST is always key values of given nodes arranged in sorted ascending order. Prateek Thakral answered Nov 6, 2017 Prateek Thakral comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer 4) Inorder Traversal of BST is always a sorted (ascending) list. iarnav answered Feb 8, 2018 iarnav comment Share Follow See all 2 Comments See all 2 2 Comments reply student2018 commented Feb 8, 2018 reply Follow Share Im unable to draw BST with given postorder 0 votes 0 votes iarnav commented Feb 8, 2018 reply Follow Share @ student2018 You can't draw BST directly from Postorder. You also need Inorder for that and that inorder is given in option 4. P.S - Though to answer this question you need not draw BST. 0 votes 0 votes Please log in or register to add a comment.