【Leetcode】C语言 94. Binary Tree Inorder Traversal

函数自调用遍历。

void travel(struct TreeNode* root,int*ret,int*size){
    if(root == NULL)
        return 0 ;
    travel(root->left,ret,size);
    ret[(*size)++] = root->val;
    travel(root->right,ret,size);
}
int* inorderTraversal(struct TreeNode* root, int* returnSize){
    *returnSize = 0;
    int *ret = malloc(sizeof(int)*100);
    travel(root,ret,returnSize);
    return ret;
}