算法入门：树的遍历

二叉树的遍历主要有前序遍历，中序遍历，后序遍历，层序遍历四种方式

• 前序遍历：中左右
• 中序遍历：左中右
• 后序遍历：左右中

递归

#include
#include
#include
#include
using namespace std;
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
		val(x), left(NULL), right(NULL) {
	}
};

void PreOrder(TreeNode *T)//前序遍历
{
	if (!T)
		return;
	cout << T->val<left);
	PreOrder(T->right);
}

void InOrder(TreeNode *T)//中序遍历
{
	if (!T)
	    return;
	InOrder(T->left);
	cout << T->val;
	InOrder(T->right);
}
 
void PostOrder(TreeNode *T)//后序遍历
{
	if (!T)
		return;
	PostOrder(T->left);
	PostOrder(T->right);
	cout << T->val;
}

非递归

#include
#include
#include
#include
using namespace std;
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
		val(x), left(NULL), right(NULL) {
	}
};

void PreOrder(TreeNode *T)//前序遍历
{
    stack< pair > s;
    TreeNode *root=T;
    s.push(make_pair(root, false));
    bool visited;
    while(!s.empty())
    {
        root = s.top().first;
        visited = s.top().second;
        s.pop();
        if(root == NULL)
            continue;
        if(visited)
        {
            path.push_back(root->val);
        }
        else
        {
            s.push(make_pair(root->right, false));
            s.push(make_pair(root->left, false));
            s.push(make_pair(root, true));
        }
    }
}

void InOrder(TreeNode *T)//中序遍历
{
    stack< pair > s;
    TreeNode *root=T;
    s.push(make_pair(root, false));
    bool visited;
    while(!s.empty())
    {
        root = s.top().first;
        visited = s.top().second;
        s.pop();
        if(root == NULL)
            continue;
        if(visited)
        {
            path.push_back(root->val);
        }
        else
        {
            s.push(make_pair(root->right, false));
            s.push(make_pair(root, true));
            s.push(make_pair(root->left, false));
        }
    }
}
 
void PostOrder(TreeNode *T)//后序遍历
{
    stack< pair > s;
    TreeNode *root=T;
    s.push(make_pair(root, false));
    bool visited;
    while(!s.empty())
    {
        root = s.top().first;
        visited = s.top().second;
        s.pop();
        if(root == NULL)
            continue;
        if(visited)
        {
            path.push_back(root->val);
        }
        else
        {
            s.push(make_pair(root, true));
            s.push(make_pair(root->right, false));
            s.push(make_pair(root->left, false));
        }
    }
}

void Levelorder(TreeNode *T)//层析遍历
{
	if (!T)
		return;
	TreeNode *temp;
	queueq;
	q.push(T);
	while (!q.empty())
	{
		temp = q.front();
		cout << temp->val;
		if (temp->left)
			q.push(temp->left);
		if (temp->right)
			q.push(temp->right);
		q.pop();
	}
}