1 votes 1 votes how to make binary search tree from the given post order traversal 1,2,3,4................n if no inorder or preorder is mentioned?????????// DS data-structures binary-search-tree descriptive + – akankshadewangan24 asked Jul 10, 2017 • recategorized Jul 6, 2022 by Lakshman Bhaiya akankshadewangan24 402 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Inorder traversal is the sorted list, you just sort the elements in increasing order and you'll get an inorder traversal. neeraj33negi answered Jul 10, 2017 neeraj33negi comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes you know that inorder traversal of BST is always sorted.. sort the given post order ..you now have both inorder and postorder Anusha Motamarri answered Jul 10, 2017 Anusha Motamarri comment Share Follow See all 2 Comments See all 2 2 Comments reply akankshadewangan24 commented Jul 10, 2017 reply Follow Share in the above que 1,2,3,4,...............n is sorted list of postorder and we have to make BST 0 votes 0 votes Anusha Motamarri commented Jul 10, 2017 reply Follow Share yeah inorder and post order are 1,2,3,...n .. it will be a BST skewed to left with n as root node and 1 as left most leaf 1 votes 1 votes Please log in or register to add a comment.
