Register

NIELIT 2017 DEC Scientist B - Section B: 30

• retagged by
1,708 views
1 votes
1 votes

If for a given Binary Search Tree (BST) the pre-order traversal is $41,23,11,31,62,50,73$. Then which of the following is its post-order traversal?

  1. $11,31,23,50,73,62,41$
  2. $31,11,23,50,41,62,73$
  3. $11,31,50,23,73,62,41$
  4. $11,31,23,50,62,73,41$
• retagged by
User Avatar

3 Answers

1 votes
1 votes
Preorder: 41,23,11,31,62,50,73

Inorder(sorted list as it is a BST): 11 23 31 41 50 62 73

Postorder: 11,31,23,50,73,62,41

Hence, option A is correct.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
admin asked Mar 31, 2020
958 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 2
In binary search tree which traversal is used for getting ascending order values ? Inorder Preorder Postorder None of the options
In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options
User Avatar
2 votes
2 votes
2 answers
3
admin asked Mar 30, 2020
1,115 views
NIELIT 2017 DEC Scientist B - Section B: 31
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is: $\Omega(\log n)$ $\Omega(n\log n)$ $\Omega(n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and the right sub trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a he...
User Avatar
Link Copied!