Binary Search Trees (I)

Following are the Binary Search Trees (BSTs) with values inserted in the left to right order (i-e From the first to the last one):

  • Tree 1 \( \implies \) 49 31 25 52 77 36 91

  • Tree 2 \( \implies \) 31 25 49 52 77 91 36

  • Tree 3 \( \implies \) 31 49 25 36 52 77 91

Which tree when printed using In-order Traversing Technique gives the sequence below ?

25 31 36 49 52 77 91


this problem is apart of this set
×

Problem Loading...

Note Loading...

Set Loading...