The in-order and pre-order traversal of a binary tree are d b e a f c g and a b d e c f g respectively. The post order traversal of a binary tree is
(A) e d b g f c a
(B) e d b f g c a
(C) d e b f g c a
(D) d e f g b c a
Answer: (C)
Explanation: Refer: GATE-CS-2007 | Question 39
Option (C) is correct.
Quiz of this Question
Article Tags :
Recommended Articles