int** levelOrderBottom(struct TreeNode* root, int* returnSize, int** returnColumnSizes) {
int** levelOrder = malloc(sizeof(int*) * 2001);
*returnColumnSizes = malloc(sizeof(int) * 2001);
*returnSize = 0;
if (!root) {
return levelOrder;
}
struct TreeNode** q = malloc(sizeof(struct TreeNode*) * 2001);
int left = 0, right = 0;
q[right++] = root;
while (left < right) {
int len = right - left;
int* level = malloc(sizeof(int) * len);
(*returnColumnSizes)[*returnSize] = len;
for (int i = 0; i < len; ++i) {
struct TreeNode* node = q[left++];
level[i] = node->val;
if (node->left != NULL) {
q[right++] = node->left;
}
if (node->right != NULL) {
q[right++] = node->right;
}
}
levelOrder[(*returnSize)++] = level;
}
for (int i = 0; 2 * i < *returnSize; ++i) {
int* tmp1 = levelOrder[i];
levelOrder[i] = levelOrder[(*returnSize) - i - 1];
levelOrder[(*returnSize) - i - 1] = tmp1;
int tmp2 = (*returnColumnSizes)[i];
(*returnColumnSizes)[i] = (*returnColumnSizes)[(*returnSize) - i - 1];
(*returnColumnSizes)[(*returnSize) - i - 1] = tmp2;
}
return levelOrder;
}
二叉树的层序遍历 II
最新推荐文章于 2024-09-11 00:16:09 发布
该代码实现了一个函数,用于对二叉树进行层次遍历,但返回的结果是从底部到顶部的顺序。它使用了广度优先搜索(BFS),并动态管理内存来存储节点值和每一层的宽度。
摘要由CSDN通过智能技术生成