二叉树系列--层序遍历（java实现）

public static int level(Node root) {
if (root == null)
return 0;
return level(root.left) + 1 > level(root.right) + 1 ? level(root.left) + 1
: level(root.right) + 1;
}

public static void levelTrav(Node root) {
if (root == null)
return;
Queue<Node> q = new ArrayDeque<Node>();
q.add(root);
Node cur;
while (!q.isEmpty()) {
cur = q.peek();
System.out.print(cur.value + " ");
if (cur.left != null)
q.add(cur.left);
if (cur.right != null)
q.add(cur.right);
q.poll();
}
}