retagged by
287 views
0 votes
0 votes

The preorder traversal sequence of a binary search tree is 

$25, 15, 10, 4, 12, 22, 18, 24, 50, 35, 31, 44, 70, 66, 90$

Which one of the following is the postorder traversal sequence of the same tree?

  1. $4, 12, 10, 18, 24, 22, 15, 31, 44, 35, 66, 90, 70, 50, 25$

  2. $4, 10, 12, 15, 18, 22, 24, 25, 31, 35, 44, 50, 66, 70, 90$

  3. $90, 70, 66, 50, 44, 35, 31, 25, 24, 22, 18, 15, 12, 10, 4$

  4. $4, 12, 10, 18, 24, 15, 22, 31, 44, 50, 66, 90, 70, 35, 25$

retagged by

1 Answer

Answer:

Related questions

0 votes
0 votes
1 answer
3
admin asked Jan 5, 2019
448 views
Consider the following array of elements$<70, 23, 60, 19, 13, 16, 1, 4, 8, 12, 7, 10, 85>$The minimum number of interchanges needed to convert into a max-heap is $4$$1$$3...