The traversals 2

Computer Science Level 2

If the post order traversal of a given binary search tree is:

9 , 13 , 11 , 16 , 15 , 20 , 24 , 23 , 17 9, 13, 11, 16, 15, 20, 24, 23, 17

Which of the following could be the in-order traversal of the tree?

9 , 13 , 11 , 17 , 24 , 23 , 20 , 16 , 15 9, 13, 11, 17, 24, 23, 20, 16, 15 9 , 11 , 13 , 15 , 16 , 17 , 20 , 23 , 24 9, 11, 13, 15, 16, 17, 20, 23, 24 24 , 11 , 13 , 15 , 16 , 17 , 20 , 23 , 9 24, 11, 13, 15, 16, 17, 20, 23, 9 9 , 11 , 24 , 20 , 17 , 13 , 23 , 15 , 16 9, 11, 24, 20, 17, 13, 23, 15, 16

Beakal Tiliksew by Beakal Tiliksew , 24, Ethiopia

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Zeeshan Ali
Dec 19, 2015

No matter how a tree (any tree) grows, the in-order traversal always gives the data in Ascending order :)

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...