For the binary tree with root a; children of a as b and e; children of b as c…
GATE · 1996 · CS · Question 1 subpartsModified — slightly modified from the official paper; see the solution
For the binary tree with root a; children of a as b and e; children of b as c and d; left child of e as f; and left child of c as g, which sequence is the post-order traversal?
- A.
f e g c d b a
- B.
g c b d a f e
- C.
g c d b f e a
- D.
f e d g c b a
Attempted by 248 students.
Sign up free to check your answer
Sign up freeLoading lesson…