陈越、何钦铭数据结构作业13:Root of AVL Tree平衡二叉树的根节点

AnAVLtreeisaself-balancingbinarysearchtree.InanAVLtree,theheightsofthetwochildsubtreesofanynodedifferbyatmostone;ifatanytimetheydifferbymorethanone,rebalancingisdonetorestorethisproperty.Figures1-4illustratetherotationrules.Nowgivenasequenceofinsertions,youaresupposedtotell