Fundamentals of an AVL Tree?

[JeffThomas]

When your implementing an AVL tree (n-1 links), how would you start off the insert method?

Do you just analyze the parents of the recently moved value in order to determine if a rotation is necessary? How do you know what side it even goes on?

And then what happens, when you delete a parent value and make the tree unbalanced?

[Norm]

How is this related to java programming?
It looks like a generic computer science quiz question.
If you have a specific question about java programming, please post it.
Include the code that shows how you have tried to solve the problem.

[JeffThomas]

I can't post questions about data structures used in java programming?

If you want you can search the forms for many other things posted, answered, and not directly related to java.

It's your call norm.

[Norm]

If you have specific java programming questions, ask them and post the code that shows what you are trying to do.

[JeffThomas]

Norm wait,

How do you determine, what goes in the beginner section and what goes in the advanced section?
The hardest question of them all!

[JosAH]

@JeffThomas: there is nothing Java specific about AVL trees (aamof, AVL trees were already in their thirties when Java saw the light); Google for "AVL tree" and you'll find all the details you need.

kind regards,

Jos