edited by
4,304 views
21 votes
21 votes

Which of the following sequences denotes the post order traversal sequence of the below tree?

  1. $f\; e\; g\; c\; d\; b\; a$
  2. $g\; c\; b\; d\; a\; f\; e$
  3. $g\; c\; d\; b\; f\; e\; a$
  4. $f\; e\; d\; g\; c\; b \;a$
edited by

3 Answers

Best answer
23 votes
23 votes

Correct Option: C

Left $\to$ Right $\to$ Root.

Ref: https://gateoverflow.in/2718/gate1996_1-14

edited by
0 votes
0 votes
Post order: Left → Right → Root.

Root is at last. (here a) So option B eliminated.

g is leftmost node so it should be traversed first. So B and D eliminated.

So C is correct.
Answer:

Related questions

29 votes
29 votes
3 answers
1
Kathleen asked Oct 9, 2014
12,123 views
In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?$1$$3$$7$$8$
26 votes
26 votes
5 answers
3
Kathleen asked Oct 9, 2014
30,453 views
A binary search tree is generated by inserting in order the following integers:$$50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$$The number of nodes in the left subtree and ...
28 votes
28 votes
3 answers
4
Kathleen asked Oct 9, 2014
13,501 views
The minimum number of interchanges needed to convert the array into a max-heap is$89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70$$0$$1$$2$$3$