void kkk(struct TreeNode* root,int *res,int* returnSize)
{
if(root == NULL)
{
return;
}
res[(*returnSize)++] = root->val;//中
kkk(root->left,res,returnSize);//左
kkk(root->right,res,returnSize);//右
}
int* preorderTraversal(struct TreeNode* root, int* returnSize)
{
int*res = (int*)malloc(sizeof(int) * 100);
*returnSize = 0;
kkk(root,res,returnSize);
return res;
}