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?

在Note中提到了最好用迭代的算法，这里还是实现了一下递归的算法：

/**
 * 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;
        inorder(root,ret);
        return ret;
    }
    
    void inorder(TreeNode *root,vector<int> &ret)
    {
        if(root == NULL) return;
        
        inorder(root->left,ret);
        ret.push_back(root->val);
        inorder(root->right,ret);
    }
    
};

12 milli secs

迭代算法要借助栈来实现，代码如下:

/**
 * 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;      
        stack<TreeNode*> stack;
        
        while(!stack.empty()||root)
        {
            if(root != NULL){
                stack.push(root);
                root = root->left;
            }else{
                root = stack.top();
                stack.pop();     
                ret.push_back(root->val);
                root = root->right;
            }    
        }
        return ret;
    }
};

16 milli secs