层序遍历二叉树 

 1 import java.util.LinkedList;
 2 import java.util.Queue;
 3 
 4 //public class Btree<K> {
 5 //    K val;
 6 //    Btree<K> left;
 7 //    Btree<K> right;
 8 //}
 9 
10 public class FloorPrint {
11     
12     public static void main(String[] args) {
13         
14         Btree<Integer> t1 = new Btree<Integer>();
15         Btree<Integer> t2 = new Btree<Integer>();
16         Btree<Integer> t3 = new Btree<Integer>();
17         Btree<Integer> t4 = new Btree<Integer>();
18         Btree<Integer> t5 = new Btree<Integer>();
19         Btree<Integer> t6 = new Btree<Integer>();
20         Btree<Integer> t7 = new Btree<Integer>();
21         
22         t1.val = 8;
23         t2.val = 6;
24         t3.val = 10;
25         t4.val = 5;
26         t5.val = 7;
27         t6.val = 9;
28         t7.val = 11;
29         
30         t1.left = t2;
31         t1.right = t3;
32         
33         t2.left = t4;
34         t2.right = t5;
35         
36         t3.left = t6;
37         t3.right = t7;
38         
39         Queue<Btree> queue = new LinkedList<Btree>();
40         queue.offer(t1);
41         while(queue.size() != 0){
42             Btree t = queue.poll();
43             System.out.println(t.val);
44             if(t.left != null){
45                 queue.offer(t.left);
46             }
47             if(t.right != null){
48                 queue.offer(t.right);
49             }
50         }
51     }
52 
53 }

 

posted @ 2017-03-14 13:38  spyder13  阅读(285)  评论(0)    收藏  举报