fig12_50.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

    void deleteMin( )
    {
        if( isEmpty( ) )
            throw UnderflowException( );
    
        PairNode *oldRoot = root;
    
        if( root->leftChild == NULL )
            root = NULL;
        else
            root = combineSiblings( root->leftChild );
    
        delete oldRoot;
    }