[leetcode]102. 二叉树的层次遍历

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

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

    3
   / \
  9  20
    /  \
   15   7
返回其层次遍历结果：

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

2.代码：

/**
 * 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 5000

typedef struct TreeNode* Tree;
typedef struct{
    Tree *array;
    int front,rear;
}Queue;

int** levelOrder(struct TreeNode* root, int* returnSize, int** returnColumnSizes){
    *returnSize=0;    
    *returnColumnSizes=(int *)malloc(sizeof(int )*MAX);
    memset(*returnColumnSizes,0,sizeof(int )*MAX);    
    int **r=(int **)malloc(MAX*sizeof(int *));
    if(!root)
        return r;
    Queue *q=(Queue *)malloc(sizeof(Queue));
    q->front=-1;
    q->rear=-1;
    q->array=(Tree *)malloc(MAX*sizeof(Tree));
    q->array[++q->rear]=root;
    int last=0;
    //先赋了保证根结点有的写
    int *s=(int *)malloc(sizeof(int )*MAX);;
    while(q->front<q->rear){
        root=q->array[++q->front];                     
        s[(*returnColumnSizes)[*returnSize]++]=root->val;
        if(root->left)
            q->array[++q->rear]=root->left;        
        if(root->right)
            q->array[++q->rear]=root->right;        
        if(q->front==last){   			    
            last=q->rear;
            r[(*returnSize)++]=s;                                   
            s=(int *)malloc(sizeof(int )*MAX);             
        }
    }
    return r;
}

3.知识点：

层次遍历