第5章 树和二叉树(3)

2. 中序遍历(LDR)

C++ Codes:

template<class T>
class Tree
{
public:
	TreeNode<T> *Root;
	Tree(TreeNode<T> *root)
	{
		this->Root=root;
	}
	void InOrder()
	{
		//Tree<T>::InOrder2(this->Root);
		Tree<T>::InOrder1(this->Root);
	}
private:
	//递归中序遍历
	static void InOrder1(TreeNode<T> *current_node)
	{
		if(current_node->Left!=0)
		{
			InOrder1(current_node->Left);
		}
		cout<<current_node->Value<<endl;
		if(current_node->Right!=0)
		{
			InOrder1(current_node->Right);
		}
	}
	//非递归中序遍历
	static void InOrder2(TreeNode<T> *current_node)
	{
		//SeqStack为一个栈，1000为其最大容量
		SeqStack<TreeNode<T>*> stack=SeqStack<TreeNode<T>*>(1000);
		while(current_node!=0)
		{
			//将当前节点及其所有左子节点压入栈
			do
			{
				stack.Push(current_node);
				current_node=current_node->Left;
			}
			while(current_node!=0);

			while(!stack.IsEmpty())
			{
				current_node=stack.Pop();
				//输出当前节点，此时当前节点的左子树已经全部输出完毕
				cout<<current_node->Value<<endl;
				current_node=current_node->Right;
				//如果右结点不为空，则将右结点作为当前节点，执行总循环；否则继续输出栈中的节点
				if(current_node!=0)
				{
					break;
				}
			}
		}
	}
};

    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);
	tree->InOrder();
    return 0;

Python Codes:

class Tree:
    def __init__(self,root):
        self.Root=root 
    def InOrder(self):
        Tree.__InOrder2(self.Root)
        #Tree.__InOrder1(self.Root)           
    @staticmethod
    def __InOrder1(current_node):
        if current_node.Left!=0:
            Tree.__InOrder1(current_node.Left)
        print current_node.Value
        if current_node.Right!=0:
            Tree.__InOrder1(current_node.Right)
    @staticmethod
    def __InOrder2(current_node):
        stack=LinkStack()
        while(current_node!=0):
            stack.Push(current_node)
            while(current_node.Left!=0):
                current_node=current_node.Left
                stack.Push(current_node)
            while not stack.IsEmpty():
                current_node=stack.Pop()
                print current_node.Value
                current_node=current_node.Right
                if current_node!=0:
                    break

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)
tree.InOrder()