leetcode练习题 binary-tree-inorder-traversal

解题思路

简单中序遍历

代码

class Solution {
public:
    void inorder(TreeNode *root,vector<int> &res){
        if(root != NULL){
            inorder(root->left,res);
            res.push_back(root->val);
            inorder(root->right,res);
        }
    }
    vector<int> inorderTraversal(TreeNode *root) {
        vector<int>res;
        inorder(root,res);
        return res;
    }
};