I have a problem, Ive searched the web, searched the boards, and now Im asking for help.
I cannot understand AVL Tree's, in particular the rotation to keep them balanced, and Im still not sure how to count there heights. I don't want code. I want example's with pictures and good explanations. If I can understand how they work, I can code it, (most probably not straight away, but I'll do it) :D . So if anyone can explain to me, with groovy little pictures of the rotation thing, I'd greatly appreciate there help.
Thx in advance
PS I would've typed in the board's search engine "AVL Trees" but it doesn't like words with less than four characters:confused: So I did the next best thing "Binary Search Trees"
Play with this for a while, it will help you to understand the operations. You can compare what happens with code that you have and it all becomes clear: