94. Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.

For example:
Given binary tree [1,null,2,3],

   1
    \
     2
    /
   3

return [1,3,2].

使用栈模拟递归过程，完成遍历，时间复杂度0（n）

class Solution {
	public:
		vector<int> inorderTraversal(TreeNode *root) {
			vector<int> result;
			const TreeNode *p = root;
			stack<const TreeNode *> s;
			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;
	}
};