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

                   this.array[i-1]=this.array[i/2-1];

                   i/=2;

              }

              this.array[i-1]=_obj;

         }

         public object findmin()

         {

              // todo:  添加 binaryheap.findmin 实现

              if( this.array.count==0 )

                   throw new exception("my:priority queue is empty");//如果队列是空的，则抛出异常