[LeetCode] Binary Tree Inorder Traversal - Iteratively

/**
 * Definition for binary tree
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> ret;
        if (!root) return ret;
        
        stack<TreeNode *> stk;
        TreeNode *node = root;
        
        while (node || !stk.empty()) {
            if (!node) {
                node = stk.top();
                stk.pop();   
                ret.push_back(node->val);
                node = node->right;
            } else {
                stk.push(node);
                node = node->left;
            }
        }
        
        return ret;
    }
};

Small Case: 8ms

Large Case: 20ms

Time: O(n)

Space: O(lgn)