[SOLVED] Cs 3345 project 2: bst and avl trees

There are two parts in this project1. Implement binary search trees. Starter code BinarySearchTree.java is in the shared folder.
The methods you need to implement are: contains(), add(), remove(). Other methods are optional.
Do not define parent field in Entry class.
IMPLEMENT the single pass algorithm discussed in the class.2. Extend BST to AVL tree. Starter code: AVLTree.java is in the shared folder. Driver code is also provided.
The methods you need to implement are: add(), verify.Implement remove() for extra credits (20 points).
Do not rewrite the code for find(), add(), and remove(). Inherit the methods from BinarySearchTree class.The number of rotations required during deletion could be O(log n). We may have to do rotation at every level.
For more details, check this https://webdocs.cs.ualberta.ca/~holte/T26/tree-deletion.htmlStarter code BinarySearchTree.java, AVLTree.java, AVLTreeDriver.java, Timer.java are in folder project2 which is in the shared box folder.
Some testcases are also provided. You should also write your own testcases. We may test your code with additional testcases.Rubric:
Code review: 40 points
Testcases: 50 points
Style: 10 points
If you do not follow the submission procedure, we will deduct 10 points.