Binary Search Trees (I)

Computer Science Level 3

Following are the B inary S earch T rees (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

The problem is a part of this set
Tree 2 All of these None of these Tree 1 Tree 3

Zeeshan Ali by Zeeshan Ali , 25, Pakistan

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Zeeshan Ali
Jan 14, 2016

The In-order Traversing Technique is used to print a BST ( B inary S earch T ree) in Ascending order . Hence all the three trees, when printed, give 25 31 36 49 52 77 91

2 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...