Tuesday, 31 October 2017

Net 42

CBSE NET JUNE 2012 PAPER II


Q. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.


(A) ABFCDE
(B) ADBFEC
(C) ABDECF
(D) None of the above


Ans: (C)


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.

Related topics

Professor Jayesh video tutorial

Please use contact page in this website if you find anything incorrect or you want to share more information about the topic discussed above.