二叉树的中序遍历

问题描述：

递归实现：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int GetTreeSize(struct TreeNode* root)
{
    if(root == NULL)
    {
        return 0;
    }
    else
    {
        return GetTreeSize(root->left) + GetTreeSize(root->right) + 1;
    }
}

void _inorderTraversal(struct TreeNode* root, int* array,int* pIndex)
{
    if(root == NULL)
        return;
    
   _inorderTraversal(root->left, array, pIndex); 
    
    array[*pIndex] = root->val;
    (*pIndex)++;
    
    _inorderTraversal(root->right, array, pIndex); 
    
}

int* inorderTraversal(struct TreeNode* root, int* returnSize)
{
    *returnSize = GetTreeSize(root);
    int* array = (int*)malloc(*returnSize*sizeof(int));
    int Index = 0;
    _inorderTraversal(root, array, &Index);
    
    return array;
}