edited by
7,273 views
25 votes
25 votes

Which of the following is/are correct in order traversal sequence(s) of binary search tree(s)?

  1. $3, 5, 7, 8, 15, 19, 25$
  2. $5, 8, 9, 12, 10, 15, 25$
  3. $2, 7, 10, 8, 14, 16, 20$
  4. $4, 6, 7, 9, 18, 20, 25$
  1. I and IV only
  2. II and III only
  3. II and IV only
  4. II only
edited by

3 Answers

Best answer
28 votes
28 votes

In order traversal of key are always in ascending order.

So, here I & IV th sequence  are in ascending order so Option A is Answer.

edited by
Answer:

Related questions

28 votes
28 votes
1 answer
2
makhdoom ghaya asked Feb 13, 2015
6,931 views
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$.$$\begin{array}{|l|l|}\hline \text{Array index} & \text{1} & \text{2} & \text{3} & \...
23 votes
23 votes
4 answers
3
25 votes
25 votes
8 answers
4
go_editor asked Feb 14, 2015
7,263 views
While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is$65$$67$$69$$83$