1. Implement the delete operation for the AVL and 2-3 trees.
2. Implement the Set ADT using an AVL search tree and evaluate the timecomplexity of each operation. 3. Implement a new version of the Color Histogram ADT to use a binary search tree for the chains instead of a linked list.