When a binary tree is traversed in preorder and inorder, the labels of the nodes are printed as below.
Preorder: A B C D E F G H
In order: B C A E G F D H
In what order the nodes appear if the same binary is traversed in post-order?
A) C B G F E H D A
B) C B E G F H D A
C) C B F G E D H A
D) Can’t be decided unless tree representation is given

• ans is A.
  FORM THE TREE BY USING PREORDER AND INORDER.
• 9 years agoHelpfull: Yes(1) No(1)
• $$ return pid
• 7 years agoHelpfull: Yes(0) No(0)