LeetCode:102. Binary Tree Level Order Traversal 二叉树的层次遍历（C语言）

题目描述：
给定一个二叉树，返回其按层次遍历的节点值。 （即逐层地，从左到右访问所有节点）。

例如:
给定二叉树: [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

返回其层次遍历结果：

[
  [3],
  [9,20],
  [15,7]
]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/binary-tree-level-order-traversal
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
解答：

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


/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
#define MAX 10000
#define LEN 1000
void insert(int val, int depth, int** ret, int** returnColumnSizes)
{
    int col = (*returnColumnSizes)[depth];
    
    ret[depth][col] = val;
    (*returnColumnSizes)[depth]++;
    
    return;
}
void dfs(struct TreeNode* root, int depth, int **ret, int* returnSize, int** returnColumnSizes)
{
    if(0 == root) return;
    
    if(0 == ret[depth])
    {
        ret[depth] = (int*)malloc(sizeof(int) * LEN);
        memset(ret[depth], 0, LEN * sizeof(int));
        
        (*returnSize)++;
    }
    
    insert(root->val, depth, ret, returnColumnSizes);
    dfs(root->left, depth + 1, ret, returnSize, returnColumnSizes);
    dfs(root->right, depth + 1, ret, returnSize, returnColumnSizes);
    
    return;
}
int** levelOrder(struct TreeNode* root, int* returnSize, int** returnColumnSizes)
{
    int **res = 0;
    *returnSize = 0;
    *returnColumnSizes = (int*)malloc(sizeof(int)*MAX);
    memset(*returnColumnSizes, 0, MAX * sizeof(int));
    
    res = (int**)malloc(sizeof(int*)*MAX);
    memset(res, 0, MAX * sizeof(int *));
    
    dfs(root, 0, res, returnSize, returnColumnSizes);
    
    return res;
}

运行结果：