I need help writing AVL in java then adding the rotations to the remove method for extra credit

First is just to write an AVL tree pretty basic after that is turned iun I need to modify the same code to use rotations when removing nodes from the tree for extra credit. I also need help with shortest path algorithm in a weighted graph but AVL and it's extra credit are my focus right now.