c++二叉树中序遍历（迭代）LeetCode94题

执行用时: 0 ms
内存消耗: 7.1 MB

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        stack< TreeNode*> all_node;//储存左节点地址
        vector<int> res;//初始化访问节点 到时候需要即压入栈
        
        while (root||all_node.size()) {
            while (root)
            {
                all_node.push(root);
                root = root->left;
            }           
            root = all_node.top();
            res.push_back(root->val);
            all_node.pop();
            root = root->right;
        }
        return res;
    }
};