leecode-C语言-94.二叉树的中序遍历

## 提醒点

递归递归! 先找到最左边的节点，左根右

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
void inorder(struct TreeNode *root, int *res, int *resSize){
		if(!root) return;
		inorder(root->left, res, resSize);
		res[(*resSize)++]  = root->val;
		inorder(root->right, res, resSize);

}



int* inorderTraversal(struct TreeNode* root, int* returnSize) {
     *returnSize = 0;
     int *res = (int *)malloc(sizeof(int )*100);
     inorder(root , res, returnSize);
     return res;
    
}