Leetcode94.Binary_Tree_Inorder_Traversal

二叉树的中序遍历的递归解法是显然的，这里只列出非递归算法。优先对左儿子向下搜索，搜索到尽头则将其值保存，再尝试向右搜索。
时间复杂度:O(N)(N为节点数)
C++代码：

class Solution {
public:
	vector<int> inorderTraversal(TreeNode* root) {
		vector<int> result;
		stack<TreeNode*> record;
		TreeNode* temp = root;
		while (temp != nullptr || !record.empty())
		{
			while (temp != nullptr)
			{
				record.push(temp);
				temp = temp->left;
			}
			if (!record.empty())
			{
				temp = record.top();
				record.pop();
				result.push_back(temp->val);
				temp = temp->right;
			}
		}
		return result;
	}
};