第5章 树和二叉树(8)

例5-3 编写算法，求二叉树的深度

Python Codes:

class TreeNode:
    def __init__(self,left=0,right=0,value=0):
        self.Left=left
        self.Right=right
        self.Value=value

class Tree:
    def __init__(self,root):
        self.Root=root 
    def GetHeight(self):
        return self.__GetHeightMethod(self.Root)
    def __GetHeightMethod(self,root):
        if root==0:
            return 0
        if root.Left==0 and root.Right==0:
            return 1
        else:
            left=self.__GetHeightMethod(root.Left)
            right=self.__GetHeightMethod(root.Right)
            if(left<right):
                return right+1
            else:
                return left+1

C++ Codes:

template<class T>
class TreeNode
{
public:
	T Value;
	TreeNode<T> *Left;
	TreeNode<T> *Right;
	TreeNode(TreeNode<T> *left=0,TreeNode<T> *right=0,T value=0)
	{
		Value=value;
		this->Left=left;
		this->Right=right;
	}
};

template<class T>
class Tree
{
public:
	TreeNode<T> *Root;
	Tree(TreeNode<T> *root)
	{
		this->Root=root;
	}
	int GetHeight()
	{
		return GetHeightMethod(this->Root);
	}
private:
	int GetHeightMethod(TreeNode<T> *root)
	{
		if(root==0)
			return 0;
		if(root->Left==0&&root->Right==0)
			return 1;
		else
		{
			int left=GetHeightMethod(root->Left);
			int right=GetHeightMethod(root->Right);
			if(left>right)
				return left+1;
			else
				return right+1;
		}
	}
};