4 votes 4 votes The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal ABFCDE ADBFEC ABDECF None of the above Algorithms ugcnetcse-june2012-paper2 algorithms + – go_editor asked Jul 4, 2016 go_editor 13.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes PreOrder Traversal:-ABDECF Hence,Option(C)ABDECF LeenSharma answered Jul 4, 2016 selected Jul 8, 2016 by Arjun LeenSharma comment Share Follow See 1 comment See all 1 1 comment reply anchitjindal07 commented Sep 10, 2018 reply Follow Share How to draw tree with postorder only or with postorder and inorder only? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes although unique tree can not be drawn just by post order to answer we have to search a possible pre-order which can be as below (ABDECF) so ans is C since A is at last in post order so it must be root so one possible tree is Sanjay Sharma answered Jul 4, 2016 Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.