AVL Tree C语言实现

<img src="https://img-blog.csdn.net/20141016123222082" alt="" /><pre name="code" class="cpp">#ifndef _AVLTree_H
删除过程
Steps to consider when deleting a node in an AVL tree are the following:
1.If node X is a leaf or has only one child, skip to step 5. (node Z will be node X)
2.Otherwise, determine node Y by finding the largest node in node X's left sub tree (in-order predecessor) or the smallest in its right sub tree (in-order successor).
3.Replace node X with node Y (remember, tree structure doesn't change here, only the values). In this step, node X is essentially deleted when its internal values were overwritten with node Y's.
4.Choose node Z to be the old node Y.
5.Attach node Z's subtree to its parent (if it has a subtree). If node Z's parent is null, update root. (node Z is currently root)
6.Delete node Z.
7.Retrace the path back up the tree (starting with node Z