第5章 树和二叉树(2)

5.2.5 二叉树的遍历

1. 先序遍历。

C++ Codes:

template<class T>
class Tree
{
public:
	TreeNode<T> *Root;
	Tree(TreeNode<T> *root)
	{
		this->Root=root;
	}
	void PreOrder()
	{
		Tree<T>::PreOrder2(this->Root);
		//Tree<T>::PreOrder1(this->Root);
	}
private:
	//递归前序遍历
	static void PreOrder1(TreeNode<T> *current_node)
	{
		cout<<current_node->Value<<endl;
		if(current_node->Left!=0)
		{
			PreOrder1(current_node->Left);
		}
		if(current_node->Right!=0)
		{
			PreOrder1(current_node->Right);
		}
	}
	//非递归前序遍历，借助辅助栈
	static void PreOrder2(TreeNode<T> *current_node)
	{
		//SeqStack为一个栈，1000为其最大容量
		SeqStack<TreeNode<T>*> stack=SeqStack<TreeNode<T>*>(1000);
		stack.Push(current_node);
		while(!stack.IsEmpty())
		{
			TreeNode<T> *current=stack.Pop();
			cout<<current->Value<<endl;
			if(current->Right!=0)
			{
				stack.Push(current->Right);
			}
			if(current->Left!=0)
			{
				stack.Push(current->Left);
			}
		}
	}
};

#pragma once
#include "stdafx.h"
#include "Tree.h"
#include <iostream>

using std::cout;
using std::endl;

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

Python Codes:

from LinkStack_LinkQueue import LinkStack

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 PreOrder(self):
        "Tree.__PreOrder1(self.Root)"
        Tree.__PreOrder2(self.Root)
    @staticmethod
    def __PreOrder1(current_node):
        print current_node.Value
        if current_node.Left!=0:
            Tree.__PreOrder1(current_node.Left)
        if current_node.Right!=0:
            Tree.__PreOrder1(current_node.Right)
    @staticmethod
    def __PreOrder2(current_node):
        stack=LinkStack()
        stack.Push(current_node)
        while not stack.IsEmpty():
            current=stack.Pop()
            print current.Value
            if not current.Right==0:
                 stack.Push(current.Right)
            if not current.Left==0:
                 stack.Push(current.Left)

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.PreOrder()