Tag: binarytree

  • Level Order Traversal of a Binary Tree

    Given the root of a binary tree , return the level order traversal of the binary tree . Level order traversal means picking nodes from left to right level by level. For example, For the below tree: Level order traversal is [[3],[9,20],[15,7]] It is a list of lists. Each list represent the nodes at that…