Level Order Traversal of Binary Tree

Try to solve the Level Order Traversal of Binary Tree problem.


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.


  • 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


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy