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?

  1. A.

    f e g c d b a

  2. B.

    g c b d a f e

  3. C.

    g c d b f e a

  4. D.

    f e d g c b a

Attempted by 232 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…