Modify the search for the AVL tree ADT to locate the immediate predecessor for a node. Once located, it tests the next node and returns found or not found and a pointer to the node (null if not...

Modify the search for the AVL tree ADT to locate the immediate predecessor for a node. Once located, it tests the next node and returns found or not found and a pointer to the node (null if not found).

Create the ADT for an AVL tree using the array implementation. In an array implementation, the pointers become indexes to the subtree elements. When you create the tree, you need to know the maximum number of nodes to be stored in the tree. To test the ADT, use it to run the program in Project 18.