第5章 树和二叉树(10)

习题 5.10 编写算法，将二叉树中所有结点的左右子树相互交换。

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;
	}
	void ReplaceElements()
	{
		Replace(this->Root);
	}
	void Replace(TreeNode<T> *root)
	{
		if(root==0)
			return;
		TreeNode<T> *node=root->Left;
		root->Left=root->Right;
		root->Right=node;
		Replace(root->Left);
		Replace(root->Right);
	}
};

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 ReplaceElements(self):
        self.__ReplaceElements(self.Root)
    def __ReplaceElements(self,root):
        if root==0:
            return
        node=root.Left
        root.Left=root.Right
        root.Right=node
        self.__ReplaceElements(root.Left)
        self.__ReplaceElements(root.Right)