Register

UPPCL AE 2018:69

• retagged by
622 views
0 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$

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · UPPCL AE 2018:68Next → · UPPCL AE 2018:71
← Previous in category · UPPCL AE 2018:65Next in category → · UPPCL AE 2018:73
Position:
Show:

Related questions

0 0 votes
1 1 answer
692
692 views
admin asked Jan 5, 2019
692 views
UPPCL AE 2018:65
Consider that $\text{N}$ distinct elements $(\text{N}>3)$ are inserted into an initially empty binary search tree $\text{(BST)}.$ Which of the following statements are tr...
0 0 votes
1 1 answer
939
939 views
admin asked Jan 5, 2019
939 views
UPPCL AE 2018:1
We create a binary search tree $\text{B}_{1}$ by inserting the numbers $1,2,3,4,5$ into an empty binary search tree. We create another binary search tree $\text{B}_{2}$ b...
0 0 votes
1 1 answer
856
856 views
admin asked Jan 5, 2019
856 views
UPPCL AE 2018:73
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...
0 0 votes
3 3 answers
888
888 views
admin asked Jan 5, 2019
888 views
UPPCL AE 2018:60
The following function attempts to merge two sorted linked lists. ListNode is the custom structure representing a node in the linked list.ListNode* Merge(ListNode* pHead1...