二叉树迭代中序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        if(!root)
            return {};
        stack<TreeNode*> s;
        vector<int> result;

        while(!s.empty() || root)
        {
            goAlongLeft(root,s);
            result.emplace_back(s.top()->val);
            root = s.top();s.pop();
            root = root->right;
        }
        return result;
    }

    static void goAlongLeft(TreeNode* root, stack<TreeNode*> &s)
    {
        while(root)
        {
            s.push(root);
            root = root->left;
        }
    }

};