# 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):

\( \implies \) 49 31 25 52 77 36 91*Tree 1*\( \implies \) 31 25 49 52 77 91 36*Tree 2*\( \implies \) 31 49 25 36 52 77 91*Tree 3*

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

**Your answer seems reasonable.**Find out if you're right!

Sign up to access problem solutions.

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.