7. Trees.
a. Fill a binary search tree with the following ordered integers:
56, 38, 42, 68, 39, 54, 59, 76, 14, 26, 22, 60.
b. Fill an AVL search tree with the following ordered integers:
56, 38, 42, 68, 39, 54, 59, 76, 14, 26, 22, 60.
c. Write a recursive algorithm in Java that will find the smallest
entry in a binary search tree. Add comments to identify the
requirements for recursion.