The binary tree - a balanced binary search tree

Learning sequence

The first article

With questions to read

Knowledge to prepare: know what is a binary search tree, predecessor and successor understand the definition of nodes, it helps to understand how to handle the conversion between the rotation process node

The question: What is a balanced binary tree

Question two: can destroy the balance under what circumstances?

Question three: What manner of balanced binary tree is broken ring is?

Question 4: Rotation is what the operation?

Question 5: How do I find unbalanced tree?

Then read this blog post from the requirements of [the local] can understand the meaning of rotation:

AVL tree illustrated rotation and simple implementation

The second article

This article is from the grasp of the overall rotation and implementation of an AVL tree

Bowen Address: AVL tree - a balanced binary search tree from