二叉树层次遍历java

1.   public static void levelOrderStack(Node p){  
2.         if(p==null)return;  
3.         List<Node> queue=new LinkedList<Node>();  
4.         queue.add(p);  
5.         while(!queue.isEmpty()){  
6.             Node temp=queue.remove(0);  
7.             System.out.print(temp.data+" ");  
8.             if(temp.left!=null){  
9.                 queue.add(temp.left);  
10.             }  
11.             if(temp.right!=null){  
12.                 queue.add(temp.right);  
13.             }  
14.         }  
15.         System.out.println();  
16.     }