Question

make a binary search tree of values 8,4,15,10 & 3.

Answer 1

Answer:

8

4 15

3 10

Explanation:

at first 8 will be the root node

then 4 is less than 8, then 4 will left child and 15 will be right child....and so on