LeetCode //C - 102. Binary Tree Level Order Traversal

102. Binary Tree Level Order Traversal

Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).

Example 1:

Input: root = [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Example 2:

Input: root = [1]
Output: [[1]]

Example 3:

Input: root = []
Output: []

Constraints:

  • The number of nodes in the tree is in the range [0, 2000].
  • -1000 <= Node.val <= 1000

From: LeetCode

Link: 102. Binary Tree Level Order Traversal


Solution:

Ideas:
  1. Create a queue to hold the nodes of the tree.
  2. Enqueue the root node to the queue.
  3. While the queue is not empty:
  • Calculate the number of nodes at the current level.
  • Allocate memory for these nodes.
  • For each node at the current level:
    • Dequeue the node from the queue.
    • Add the node's value to the result.
    • Enqueue the node's left child (if it exists).
    • Enqueue the node's right child (if it exists).
  1. Return the result.
Code:
c 复制代码
/**
 * 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().
 */
int** levelOrder(struct TreeNode* root, int* returnSize, int** returnColumnSizes) {
    if (!root) {
        *returnSize = 0;
        return NULL;
    }

    // Create a queue for BFS
    struct TreeNode** queue = malloc(2000 * sizeof(struct TreeNode*));
    int front = 0, rear = 0;

    // Enqueue root
    queue[rear++] = root;

    int** result = malloc(2000 * sizeof(int*));
    *returnColumnSizes = malloc(2000 * sizeof(int));
    *returnSize = 0;

    while (front < rear) {
        // Number of nodes at current level
        int levelSize = rear - front;
        (*returnColumnSizes)[*returnSize] = levelSize;

        // Allocate memory for nodes of this level
        result[*returnSize] = malloc(levelSize * sizeof(int));

        for (int i = 0; i < levelSize; i++) {
            // Dequeue node
            struct TreeNode* current = queue[front++];

            // Add node's value to result
            result[*returnSize][i] = current->val;

            // Enqueue left child
            if (current->left) {
                queue[rear++] = current->left;
            }
            
            // Enqueue right child
            if (current->right) {
                queue[rear++] = current->right;
            }
        }
        (*returnSize)++;
    }
    free(queue);
    return result;
}
相关推荐
ゞ 正在缓冲99%…19 分钟前
leetcode918.环形子数组的最大和
数据结构·算法·leetcode·动态规划
Kaltistss1 小时前
98.验证二叉搜索树
算法·leetcode·职场和发展
知己如祭1 小时前
图论基础(DFS、BFS、拓扑排序)
算法
mit6.8241 小时前
[Cyclone] 哈希算法 | SIMD优化哈希计算 | 大数运算 (Int类)
算法·哈希算法
c++bug1 小时前
动态规划VS记忆化搜索(2)
算法·动态规划
哪 吒1 小时前
2025B卷 - 华为OD机试七日集训第5期 - 按算法分类,由易到难,循序渐进,玩转OD(Python/JS/C/C++)
python·算法·华为od·华为od机试·2025b卷
军训猫猫头2 小时前
1.如何对多个控件进行高效的绑定 C#例子 WPF例子
开发语言·算法·c#·.net
success2 小时前
【爆刷力扣-数组】二分查找 及 衍生题型
算法
Orlando cron3 小时前
数据结构入门:链表
数据结构·算法·链表