11. Draw the binary search tree resulting from inserting the nodes with the integer key values: 68, 23, 45, 90, 70, 21, and 55 into the tree. Assume key 68 is inserted first, then key 23, etc.

1. Give an advantage of a binary search tree structure over:

b. A stack

2. Define the terms:

f. Highest level of a tree