Redirected
retagged by
1,803 views
0 votes
0 votes

Post-order traversal of a given binary search tree $T$ produces following sequence of keys: $3,5,7,9,4,17,16,20,18,15,14$. Which one of the following sequences of keys can be the result of an in-order traversal of the tree $T$?

  1. $3,4,5,7,9,14,20,18,17,16,15$
  2. $20,18,17,16,15,14,3,4,5,7,9$
  3. $20,18,17,16,15,14,9,7,5,4,3$
  4. $3,4,5,7,9,14,15,16,17,18,20$
retagged by

3 Answers

0 votes
0 votes
Option D

since given tree is BST

Inorder Traversal of BST is always key values of given nodes arranged in sorted ascending order.
0 votes
0 votes

Answer 4)

Inorder Traversal of BST is always a sorted (ascending) list.

Answer:

Related questions

1 votes
1 votes
2 answers
1
Arjun asked Nov 5, 2017
3,072 views
Which speed up could be achieved according to Amdahl's Law for infinte number of processes if $5\%$ of a program is sequential and the remaining part is ideally parallel?...
0 votes
0 votes
1 answer
2
Arjun asked Nov 5, 2017
2,522 views
Which of the given wireless technologies used in IoT, consumes the least amount of power?ZigbeeBluetoothWi-FiGSM/CDMA
0 votes
0 votes
2 answers
3
Arjun asked Nov 5, 2017
4,593 views
Which of the following is not a Clustering method?K-Means methodSelf Organizing feature map methodK- nearest neighbor methodAgglomerative method