二叉树的后序遍历

给定一个二叉树，返回它的 后序 遍历。

示例:

输入: [1,null,2,3]  
   1
    \
     2
    /
   3 

输出: [3,2,1]

https://leetcode-cn.com/problems/binary-tree-postorder-traversal/description/
递归后序遍历

/**
 * 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 TreeNodeSize(struct TreeNode * root)
{
    if(NULL == root)
        return 0;
    return 1 + TreeNodeSize(root->left) + TreeNodeSize(root->right);
}

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

int* postorderTraversal(struct TreeNode* root, int* returnSize) {
    *returnSize = TreeNodeSize(root);
    int *array = (int *)malloc(*returnSize * sizeof(int));
    int index=0;
    _postorderTraversal(root,array,&index);
    return array;
    
}