树的学习（二）

第二讲来学习二叉树的三种遍历方法，分别是前序遍历，中序遍历以及后序遍历。三种遍历都可以用递归和非递归实现

 class TreeNode
{
	TreeNode *left;
	TreeNode *right;
	int  val;
};

递归的三种遍历

//前序遍历
	void preorder(TreeNode *root, vector<int> &path)
	{
		if (root != NULL)
		{
			path.push_back(root->val);
			preorder(root->left, path);
			preorder(root->right, path);
		}
	}

	//中序遍历
	void inorder(TreeNode *root, vector<int> &path)
	{
		if (root != NULL)
		{
			inorder(root->left, path);
			path.push_back(root->val);
			inorder(root->right, path);
		}
	}

	//后续遍历
	void postorder(TreeNode *root, vector<int> &path)
	{
		if (root != NULL)
		{
			postorder(root->left, path);
			postorder(root->right, path);
			path.push_back(root->val);
		}
	}

递归的三种遍历运用了栈的思想，依次将每一个元素为结点，以及其左右结点压入栈，在出栈。

//非递归前序遍历
	void preorderTraversalNew(TreeNode *root, vector<int> &path)
	{
		stack< pair<TreeNode *, bool> > s;
		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 inorderTraversalNew(TreeNode *root, vector<int> &path)
	{
		stack< pair<TreeNode *, bool> > s;
		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 postorderTraversalNew(TreeNode *root, vector<int> &path)
	{
		stack< pair<TreeNode *, bool> > s;
		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));
			}
		}
	}

参考：https://blog.csdn.net/sdulibh/article/details/50573036