UGC NET CSE | June 2012 | Part 2 | Question: 2

Question

The post order traversal of a binary tree is DEBFCA. Find out the pre-order traversal

• A. ABFCDE
• B. ADBFEC
• C. ABDECF
• D. None of the above

Answer 1

PreOrder Traversal:-ABDECF

Hence,Option(C)ABDECF

Comments

How to draw tree with postorder only or with postorder and inorder only?

Answer 2

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