Tree: Level Order Traversal

  • + 17 comments

    My Java Solution

    Queue queue=new LinkedList();
    queue.add(root);
    while(!queue.isEmpty())
    {
    Node tempNode=queue.poll();
    System.out.print(tempNode.data+" ");
    if(tempNode.left!=null)
    queue.add(tempNode.left);
    if(tempNode.right!=null)
    queue.add(tempNode.right);
    }