Hello, I am trying to create an AVL tree in java and I'm not quite sure on how I would balance my tree. I'm not too sure on how to start my check or how to begin my check, would I start by checking the depth of both left and right side? But then how would I pin point where to start balancing? I have to use recursion. I'm not looking for code (though if you feel compelled to do so please don't let me stop you) just an explanation.