1 Implement the Set ADT using an AVL search tree and evaluate the time- complexity of each operation. 2 Implement a new version of the Color Histogram ADT (from Chapter 11) to use a binary search tree...

1 Implement the Set ADT using an AVL search tree and evaluate the time- complexity of each operation.

2 Implement a new version of the Color Histogram ADT (from Chapter 11) to use a binary search tree for the chains instead of a linked list.

3 Design and implement the bstBuild() function, which takes a sequence of keys and builds a new search tree from those keys. For example, the function could be used to build the binary search tree.

keyList = [60, 25, 100, 35, 17, 80]

buildBST( keyList )