1 votes 1 votes A rooted tree with 8 nodes has its nodes [1.....8] in preorder.When the tree is traversed in postorder.....nodes visited are {3,5,4,2,7,8,6,1}. Draw a tree for it. How to solve .....someone please explain? DS binary-tree data-structures + – Shivi rao asked Nov 1, 2017 edited Nov 1, 2017 by joshi_nitish Shivi rao 629 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Hemant Parihar commented Nov 1, 2017 reply Follow Share We can construct the unique binary tree using preorder and postorder if we assume (or it is given) that every internal node has two children. 1 votes 1 votes Shivi rao commented Nov 1, 2017 reply Follow Share Please elaborate it 0 votes 0 votes A_i_$_h commented Nov 8, 2017 reply Follow Share @hemant canu give an example of such a question with solution will be helpful :) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes pre-order = 12345678 post-order = 35427861 Badayayash answered Jan 23, 2019 Badayayash comment Share Follow See all 0 reply Please log in or register to add a comment.