[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].

不用解释。

/**
 * 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> *v = new vector<int>();
        Travel(root,v);
        return *v;
    }
    void Travel(TreeNode *root,vector<int> * v)
    {
        if(root != NULL)
        {
        Travel(root->left,v);
        v->push_back(root->val);
        Travel(root->right,v);
    }
    }
};