递归。
void func(struct TreeNode* root, int* res, int* index)
{
if(NULL == root) return;
res[(*index)] = root->val;
(*index)++;
func(root->left, res, index);
func(root->right, res, index);
}
int* preorderTraversal(struct TreeNode* root, int* returnSize)
{
*returnSize = 0;
int* res = malloc(sizeof(int) * 100);
func(root, res, returnSize);
return res;
}