0 votes 0 votes Acc. to (question) my solution is... uniquely constructed binary tree PRE+POST and IN+POST… where i am wrong…. Algorithms tree-traversal data-structures + – Vikas123 asked Jan 8, 2019 Vikas123 719 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply adarsh_1997 commented Jan 8, 2019 reply Follow Share @Vikas123 it is given not sufficient to draw unique binary tree. all three options from starting is used to draw a unique binary tree whereas (post,pre) is not sufficient to draw unique BT.(more than 1 are possible) 0 votes 0 votes Vikas123 commented Jan 8, 2019 reply Follow Share but here given that PRE- preorder IN- postorder POST- inorder LVL- level order and according to you (post, pre)--(in-order , pre-order) and it give unique binary tree.... correct me if am wrong...plz 0 votes 0 votes Please log in or register to add a comment.
