Draw the binary search tree that results from starting with an empty tree and a. adding 50 72 96 94 26 12 11 9 2 10 25 51 16 17 95
b. adding 95 17 16 51 25 10 2 9 11 12 26 94 96 72 50
c. adding 10 72 96 94 85 78 80 9 5 3 1 15 18 37 47
d. adding 50 72 96 94 26 12 11 9 2 10, then removing 2 and 94
e. adding 50 72 96 94 26 12 11 9 2 10, then removing 50 and 26
f. adding 50 72 96 94 26 12 11 9 2 10, then removing 12 and 72