从上到下打印二叉树
从上到下打印出二叉树的每个节点,同一层的节点按照从左到右的顺序打印。
例如:
给定二叉树: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回:
[3,9,20,15,7]
提示:
节点总数 <= 1000
解法
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
struct queue{
// 1. 当前元素所在的位置
// 2. 队列中元素的个数
int cur_elem_pos;
int last_elem_pos;
struct TreeNode *elem;
};
void init_queue(struct queue* q){
q->cur_elem_pos = 0;
q->last_elem_pos = 0;
q->elem = (struct TreeNode *)malloc(sizeof(struct TreeNode)*1010);
}
// 队列获取队首元素
struct TreeNode pop(struct queue *q){
// 不进行判断
struct TreeNode node = q->elem[q->cur_elem_pos];
q->cur_elem_pos ++;
return node;
}
void push(struct queue * q, struct TreeNode e){
q->elem[q->last_elem_pos++] = e;
}
void printTree(struct queue *q, int *res, int *returnSize){
if(q->cur_elem_pos == q->last_elem_pos){
return;
}
// 从队列中取元素
struct TreeNode node = pop(q);
*returnSize += 1;
*res = node.val;
res++;
if(node.left != NULL){
push(q, *node.left);
}
if(node.right != NULL){
push(q, *node.right);
}
printTree(q, res, returnSize);
}
int* levelOrder(struct TreeNode* root, int* returnSize){
// 初始化队列
struct queue *q = (struct queue*)malloc(sizeof(struct queue));
init_queue(q);
// 分配一个大小为1000,类型为int的空间
int *res = malloc(sizeof(int)*1010);
// 初始化树的长度
*returnSize = 0;
if(root == NULL){
return res;
}
// push root to queue
push(q, *root);
// printTree
printTree(q, res, returnSize);
return res;
}