tree：二叉树中序遍历

Leetcode, BinaryTreeInorderTraversal

#include <iostream>
#include <vector>
#include <stack>
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*> s;
	const TreeNode *p = root;

	while (!s.empty() || p != nullptr)
	{
		if ( p != nullptr )
		{
			s.push(p);	//把左边的节点依次压入栈中
			p = p->left;
		}
		else
		{
			p = s.top();	//左边已经为空了，弹出，看右边有没有节点
			s.pop();
			result.push_back(p->val);
			
			p = p->right;
		}
	}

	return result;
}

//Morris中序遍历 时间复杂度O（n）,空间复杂度O（1）
vector<int> solution2(TreeNode *root)
{
	vector<int> result;
	TreeNode *cur = root;
	while (cur != nullptr)
	{
		if (cur->left == nullptr)
		{
			result.push_back(cur->val);
			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;
				cur = cur->left;
			}
			else
			{
				result.push_back(cur->val);
				node->right = nullptr;
				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);	//4251637
	auto vec = solution2(node1);	//4251637

	return 0;
}