文件名称:Root-of-AVL-Tree
介绍说明－－下载内容均来自于网络，请自行研究使用
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-04-树5 Root of AVL Tree
编译器：python2-An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.
PTA-04-树5 Root of AVL Tree
编译器：python2-An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Root of AVL Tree.py