inorder_traversal_iterative.cpp

/**
 * 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) {
        vector<int> ret;
        vector<TreeNode *> stack;
        if(root == NULL)
            return ret;
        TreeNode *current=root;
        int top=-1;
        while(current!=NULL)
        {
            stack.push_back(current);
            top++;
            if(current->left==NULL)
            {
                //ret.push_back(current->val);
                while(top>=0)
                {
                    current = stack[top];
                    top--;
                    stack.pop_back();
                    ret.push_back(current->val);
                    if(current->right != NULL)
                    {
                        break;
                    }
                }
                current=current->right;
                continue;
                
            }
            current=current->left;
                
        }
        return ret;
    }
};