leetcode:Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [1,3,2].

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

Subscribe to see which companies asked this question

/**
 * 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 {

private:
    void pushLeftChild(TreeNode* root, stack<TreeNode*> &auxStack)
    {
        if (!root)
            return;
        TreeNode* curNode = root;
        while (curNode)
        {
            auxStack.push(curNode);
            curNode = curNode->left;
        }
    }
    
public:
    vector<int> inorderTraversal(TreeNode* root) {
        
        vector<int> retVtr;
        
        if (root == NULL)
            return retVtr;
            
        stack<TreeNode*> auxStack;
        
        pushLeftChild(root, auxStack);
        
        while (auxStack.size() > 0)
        {
            TreeNode* curNode = auxStack.top();
            auxStack.pop();
            retVtr.push_back(curNode->val);
            
            if (curNode->right)
            {
                pushLeftChild(curNode->right, auxStack);
            }
        }
        
        return retVtr;
    }
};