二叉樹的屬性操作

count() = 10;

height() = 4;

degree() = 2;

二叉樹結點的數目

-定義功能：count(node)

·在node為根結點的二叉樹中統計結點數目

int count(BTreeNode<T>* node)const
    {
        return (node != NULL)?(count(node->left) +count(node->right)+1) : 0;
    }

二叉樹的高度

-定義功能：height(node)

·獲取node為根節點的二叉樹的高度

int height(BTreeNode<T>* node)const
    {
        int ret = 0;
        if(node != NULL)
        {
            int lh = height(node->left);
            int rh = height(node->right);

            ret = ((lh > rh) ? lh : rh)+1;
        }
        return ret;
    }

樹的度數

-定義功能：degree(node)

·獲取node為根節點的二叉樹的度數

int degree(BTreeNode<T>* node) const
    {
        int ret = 0;
        if(node != NULL)
        {
            BTreeNode<T>* childp[] = {node->left,node->right};
            ret = (!!node->left + !!node->right);

            for(int i = 0;(i<2) && (ret < 2);i++)
            {
                int d = degree(child[i]);

                if(ret < d)
                {
                    ret = d;
                }
            }

        }
        return ret;
    }