LeetCode探索： 二叉树的后序遍历 [C语言]

LeetCode探索：  二叉树的后序遍历 [C语言]

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

示例:

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

输出: [3,2,1]

进阶: 递归算法很简单，你可以通过迭代算法完成吗？

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

int recurCount(struct TreeNode* root) {
    if(root==NULL) return 0;
    
    return recurCount(root->left) + recurCount(root->right) + 1;    
}

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



/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* postorderTraversal(struct TreeNode* root, int* returnSize){

    *returnSize = 0;

    if(root==NULL) return NULL;

    int bufSize = sizeof(int)*recurCount(root);

    int* res = (int*)malloc(bufSize);
    memset(res, 0, bufSize);

    postorder(root, res, returnSize);

    return res; 
}