数据结构教程ch08.ppt

* Node[i].rootleftChild = Node[i].rootrightChild = NULL; } hp.MinHeap ( Node, n ; for ( int i = 0; i < n-1; i++ ) { hp.DeleteMin ( first ; hp.DeleteMin ( second ; newtree = new ExtBinTree ( fi