二叉树的中序遍历

/**
 * 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:
    std::vector<int> temp;
    vector<int> inorderTraversal(TreeNode* root) {
        if(root!=NULL){
        inorderTraversal(root->left);
        temp.push_back(root->val);
        inorderTraversal(root->right);
        }
        return temp;
    }
};