資料結構與演算法(C#實現)系列—AVLTree（二）

          資料結構與演算法(C#實現)系列---AVLTree（二）

         //---------------override--------------------

         public override void AttachKey(object _obj)

         {

              if(!IsEmpty())

                   throw new Exception("My:this node must be a empty tree node!");

              this.key=_obj;

              //產生一個degree長的數組,並將其初始化為空白樹

              this.treeList=new ArrayList();

              this.treeList.Capacity=(int)this.degree;

 

        

              for(int i=0;i<this.degree;i++)

              {

                   treeList.Add(new AVLTree());

              }

              //

              this.height=0;

         }

         //在改動樹的結構後平衡樹

         public override void Balance()

         {

              this.AdjustHeight();

              //大於1則說明不平衡

              if( Math.Abs(this.BalanceFactor())>1)

              {

                   if(this.BalanceFactor()>0)

                   {

                       if (((AVLTree)this.Left).BalanceFactor()>0)

                            this.LLRotation();

                       else

                            this.LRRotation();

                   }                 

                   else

                   {

                       if (((AVLTree)this.Right).BalanceFactor()<0)

                            this.RRRotation();

                       else

                            this.RLRotation();

                   }

              }

         }

 

 

        

         public int Height{get{return this.height;}}

        

}