Leetcode Binary Tree Inorder Traversal

题意：inorder 遍历。

思路：dfs。

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