Tree Traversal

Question

 

Comments

:) That i know brother. I was Asking that the reverse of post order is the converse Post order if i am not wrong. But i created the tree and simply did the post order traversal and got the answer i didn't do any reverse.

---

reverse of post order is the converse Post order

reverse of post order is the converse Pre order .... check the image correctly.

---

actually, given that it is a expression tree ===> uniquely we can construct a tree !

please check it https://gateoverflow.in/201903/last-level-order

Answer 1

So, I came up with this conclusion :

Reverse of postorder → Converse preorder

Reverse of preorder → Converse postorder

Reverse of inorder → converse of inorder

Answer 2

The expression is given in reverse polish notation .it means that is in post order.

Reverse polish notation => post order traversal

Make a expression tree for above post order expression is

From above expression tree NEW ORDER TRAVERSAL is 11 17 16 * + 12 15 14 13 * - ^ –

 

( Above new traversal strategy is called CONVERSE POSTORDER . )

If  give traverse ROOT , RIGHT , LEFT => called  CONVERSE PREORDER

If give traverse RIGHT, LEFT, ROOT => called CONVERSE POSTORDER

 

Answer 3

Given expression is post-order traversal i.e. postfix. Hence make its syntax tree ( Left- Right- Root)

Now converse post-order traversal is root-right-left. Traverse in this manner and we will get option C as answer