94. Binary Tree Inorder Traversal

[LeetCode] 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].

Note: Recursive solution is trivial, could you do it iteratively?

---

用迭代实现中序遍历。

---

定义栈，取栈顶节点，保存到数组。然后每当push一个该节点的左节点的时候，把该节点的左节点的所有右节点push进去。最后反向输出即可。
我们这样就保证了栈顶永远都是下面的右子树。

---

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> ans;
        TreeNode* p = new TreeNode(0);
        p->left = root;
        stack<int> res;
        stack<TreeNode*> s;
        s.push(p);
        while (!s.empty()) {
            TreeNode* tmp = s.top();
            res.push(tmp->val);
            s.pop();
            if (tmp->left) {
                s.push(tmp->left);
                TreeNode* tl = tmp->left;
                while (tl->right) {
                    s.push(tl->right);
                    tl = tl->right;
                }
            }
        }
        while (!res.empty()) {
            ans.push_back(res.top());
            res.pop();
        }
        ans.pop_back();
        return ans;
    }
};