第5章 树和二叉树(9)

习题 5.9 编写算法,求二叉树中分支结点的数目。

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 CountBranchNode()
	{
		return CountBranchNodeMethod(this->Root);
	}
private:
	int CountBranchNodeMethod(TreeNode<T> *root)
	{
		if(root==0)
			return 0;
		if(root->Left==0&&root->Right==0)
			return 0;
		else
			return 1+CountBranchNodeMethod(root->Left)+CountBranchNodeMethod(root->Right);
	}
};

int main()
{
    TreeNode<int> *node1=new TreeNode<int>(0,0,1);
	TreeNode<int> *node2=new TreeNode<int>(0,0,2);
	TreeNode<int> *node3=new TreeNode<int>(node1,node2,3);
	TreeNode<int> *node4=new TreeNode<int>(0,0,4);
	TreeNode<int> *node5=new TreeNode<int>(0,0,5);
	TreeNode<int> *node6=new TreeNode<int>(node3,node4,6);
	TreeNode<int> *node7=new TreeNode<int>(node5,node6,7);
	TreeNode<int> *node8=new TreeNode<int>(0,0,8);
	TreeNode<int> *node9=new TreeNode<int>(0,0,9);
	TreeNode<int> *node10=new TreeNode<int>(node8,node9,10);
	TreeNode<int> *node11=new TreeNode<int>(node10,0,11);
	TreeNode<int> *node12=new TreeNode<int>(node7,node11,12);
	Tree<int> *tree=new Tree<int>(node12);
	cout<<tree->CountBranchNode()<<endl;
    return 0;
}

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 CountBranchNode(self):
        return self.__CountBranchNode(self.Root)
    def __CountBranchNode(self,root):
        if root==0:
            return 0
        if root.Left==0 and root.Right==0:
            return 0
        else:
            return 1+self.__CountBranchNode(root.Left)+self.__CountBranchNode(root.Right)

from Tree import Tree,TreeNode

node1=TreeNode(value=1)
node2=TreeNode(node1,0,2)
node3=TreeNode(value=3)
node4=TreeNode(value=4)
node5=TreeNode(node3,node4,5)
node6=TreeNode(node2,node5,6)
node7=TreeNode(node6,0,7)
node8=TreeNode(value=8)
root=TreeNode(node7,node8,10)
tree=Tree(root)
print tree.CountBranchNode()