21 votes 21 votes Which of the following sequences denotes the post order traversal sequence of the below tree? $f\; e\; g\; c\; d\; b\; a$ $g\; c\; b\; d\; a\; f\; e$ $g\; c\; d\; b\; f\; e\; a$ $f\; e\; d\; g\; c\; b \;a$ DS gate1996 data-structures binary-tree easy + – Kathleen asked Oct 9, 2014 edited Jun 17, 2019 by Lakshman Bhaiya Kathleen 4.3k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Anu commented May 30, 2015 reply Follow Share https://gateoverflow.in/2718/gate1996_1-14?show=2718#q2718 0 votes 0 votes Tia sharma commented Mar 9, 2020 reply Follow Share C) g c d b f e a 0 votes 0 votes Please log in or register to add a comment.
Best answer 23 votes 23 votes Correct Option: C Left $\to$ Right $\to$ Root. Ref: https://gateoverflow.in/2718/gate1996_1-14 Gate Keeda answered Oct 10, 2014 edited May 5, 2021 by soujanyareddy13 Gate Keeda comment Share Follow See all 2 Comments See all 2 2 Comments reply Puja Mishra commented Dec 24, 2017 reply Follow Share Tree Traversals 0 votes 0 votes Sohail1432 commented Jan 24, 2018 reply Follow Share Pre Order : Visit,Left,Right In Order : Left Visit Right Post Order : Left, Right, Visit 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes gcdbfea option c is right Rishi yadav answered Oct 4, 2017 Rishi yadav comment Share Follow See all 0 reply Please log in or register to add a comment.
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. smsubham answered Mar 9, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.