tree：二叉树后序遍历

Leetcode, BinaryTreePostorderTraversal

#include <iostream>
#include <vector>
#include <stack>
#include <functional>
using namespace std;

struct TreeNode
{
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(nullptr), right(nullptr) { }
};

//两个栈 时间复杂度O（n）,空间复杂度O（n）
vector<int> solution(TreeNode *root)
{
	vector<int> result;
	stack<const TreeNode*> s1;
	stack<const TreeNode*> s2;	//用来存放按后序排序好的二叉树
	const TreeNode *p = root;
	s1.push(p);
	while ( !s1.empty() )
	{
		p = s1.top();
		s1.pop();
		s2.push(p);
		if (p->left != nullptr  )
		{
			s1.push(p->left);
		}
		if ( p->right != nullptr )
		{
			s1.push(p->right);
		}
	}
	while (!s2.empty())
	{
		result.push_back(s2.top()->val);
		s2.pop();
	}

	return result;
}

//单栈 时间复杂度O（n）,空间复杂度O（n）
vector<int> solution2(TreeNode *root)
{
	vector<int> result;
	// p，正在访问的结点，q，刚刚访问过的结点
	const TreeNode *p, *q;
	stack<const TreeNode *> s;
	p = root;

	do {
		while (p != nullptr)
		{
			s.push(p);	// 往左下走 
			p = p->left;
		}
		q = nullptr;
		while (!s.empty())
		{
			p = s.top();
			s.pop();
			//右孩子不存在或已被访问，访问之
			if (p->right == q)
			{
				result.push_back(p->val);
				q = p; // 保存刚访问过的结点
			}
			else
			{
				// 当前结点不能访问，需第二次进栈
				s.push(p);
				// 先处理右子树
				p = p->right;
				break;
			}
		}
	} while (!s.empty());
	return result;
}

//逆转路径
void reverse(TreeNode *from, TreeNode *to)
{
	TreeNode *x = from, *y = from->right, *z;
	if (from == to) return;

	while (x != to)
	{
		z = y->right;
		y->right = x;
		x = y;
		y = z;
	}
}

//访问逆转后的路径上的所有节点
void visit_reverse(TreeNode* from, TreeNode *to, std::function< void(const TreeNode*) >& visit) 
{
	TreeNode *p = to;
	reverse(from, to);

	while (true) 
	{
		visit(p);
		if (p == from)
			break;
		p = p->right;
	}
	reverse(to, from);
}

//Morris中序遍历 时间复杂度O（n）,空间复杂度O（1）
vector<int> solution3(TreeNode *root)
{
	vector<int> result;
	TreeNode dummy(-1);
	TreeNode *cur, *prev = nullptr;
	std::function < void(const TreeNode*)> visit =
		[&result](const TreeNode *node) { result.push_back(node->val); };

	dummy.left = root;
	cur = &dummy;
	while (cur != nullptr) {
		if (cur->left == nullptr) {
			prev = cur;
			cur = cur->right;
		}
		else {
			TreeNode *node = cur->left;
			while (node->right != nullptr && node->right != cur)
				node = node->right;
			if (node->right == nullptr)
			{ 
				node->right = cur;
				prev = cur;
				cur = cur->left;
			}
			else 
			{ 
				visit_reverse(cur->left, prev, visit);
				prev->right = nullptr;
				prev = cur; 
				cur = cur->right;
			}
		}
	}
	return result;
}

int main()
{
	TreeNode *node1 = new TreeNode(1);
	TreeNode *node2 = new TreeNode(2);
	TreeNode *node3 = new TreeNode(3);
	TreeNode *node4 = new TreeNode(4);
	TreeNode *node5 = new TreeNode(5);
	TreeNode *node6 = new TreeNode(6);
	TreeNode *node7 = new TreeNode(7);
	node1->left = node2;
	node1->right = node3;
	node2->left = node4;
	node2->right = node5;
	node3->left = node6;
	node3->right = node7;

	//auto vec = solution(node1);	//4526731
	auto vec = solution2(node1);	//4526731
	//auto vec = solution3(node1);	//4526731

	return 0;
}