二叉树的层序遍历

最新推荐文章于 2024-09-11 00:16:09 发布

m0_73423145

最新推荐文章于 2024-09-11 00:16:09 发布

阅读量42

点赞数

文章标签：算法数据结构

本文链接：https://blog.csdn.net/m0_73423145/article/details/128977166

版权

int** levelOrder(struct TreeNode* root,int* returnSize,int** returnColumnSizes)
{
*returnSize = 0;
if(root == NULL)
return NULL;
int** returnNums = (int**)malloc(sizeof(int*) * 2001);
*returnColumnSizes = (int*)malloc(sizeof(int) * 2001);
struct TreeNode* queueDat[2001];
int queueFront = 0;
int queueRear = 0;
struct TreeNode* cur;

queueDat[queueRear++] = root;
while(queueFront != queueRear)
{
int colSize = 0;
int last = queueRear;
returnNums[*returnSize] = (int*)malloc(sizeof(int) * (last - queueFront));
while(queueFront < last)
{
cur = queueDat[queueFront++];
returnNums[*returnSize][colSize++] = cur ->val;
if(cur -> left != NULL)
queueDat[queueRear++] = cur -> left;
if(cur -> right != NULL)
queueDat[queueRear++] = cur -> right;
}
(*returnColumnSizes)[*returnSize] = colSize;
(*returnSize)++;
}
return returnNums;
}