fig04_60.cpp

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

    /**
     * Internal method to compute the height of a subtree rooted at t.
     */
    int height( BinaryNode *t )
    {
        if( t == NULL )
            return -1;
        else
            return 1 + max( height( t->left ), height( t->right ) );
    }