CBSE NET JUNE 2012 PAPER II
Q. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
(D) None of the above
Explanation: DFD – Inorder (Left,Root,Right), Preorder (Root,Left,Right), Postorder (Left,Right,Root). So, POSTORDER to BINARY TREE will like this.
Than BINARY TREE to PREORDER. Where PREORDER (Root, Left, Right) = ABDECF.