Tap here to switch tabs
Problem
Submissions

Problem: Level Order Traversal of Binary Tree

Binary Tree Level Order Traversal asks you to return each level's node values in order, joining levels with colons and returning “None” for an empty tree.

Statement

Given the root of a binary tree, display the values of its nodes while performing a level order traversal. Return the node values for all levels in a string separated by the character :. If the tree is empty, i.e., the number of nodes is 00, then return “None” as the output.

Constraints:

  • The number of nodes in the tree is in the range [0,500][0, 500].

  • −103≤-10^3 \leq Node.data ≤103\leq 10^3

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Level Order Traversal of Binary Tree

Binary Tree Level Order Traversal asks you to return each level's node values in order, joining levels with colons and returning “None” for an empty tree.

Statement

Given the root of a binary tree, display the values of its nodes while performing a level order traversal. Return the node values for all levels in a string separated by the character :. If the tree is empty, i.e., the number of nodes is 00, then return “None” as the output.

Constraints:

  • The number of nodes in the tree is in the range [0,500][0, 500].

  • −103≤-10^3 \leq Node.data ≤103\leq 10^3