数据结构与算法(C#实现)系列---二叉堆（数组实现）[4]

         public void enqueue(object _obj)

         {

              // todo:  添加 binaryheap.enqueue 实现

              if( this.array.count==this.array.capacity )

                   throw new exception("my:priority queue is full");//如果优先队列已满，则抛出异常

              this.array.add(new object());

              int i=this.array.count;

              while(i>1&&comparer.default.compare(this.array[i/2-1],_obj  )>0)

              {

                   //this.item(i)=this.item(i/2);