Question- Consider the given list of keys.
38 120 22 68 11 12 60 9 59 601
Part 1- Draw the binary search tree which results from inserting the number in left-to-right order, assuming no balancing:
Part 2- Delete in order: ( 68 22 38 120) describing careful the procedure.
You have to draw the binary search tree which results from inserting the number.