例如:
给定的二叉树是{3,9,20,#,#,15,7},
该二叉树层序遍历的结果是
[
[3],
[9,20],
[15,7]
]
代码:
public class BinaryTreeLevelOrder {
public static class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
public static void main(String[] args) {
TreeNode treeNode = new TreeNode(3);
TreeNode treeNode2 = new TreeNode(9);
TreeNode treeNode3 = new TreeNode(20);
TreeNode treeNode4 = new TreeNode(15);
TreeNode treeNode5 = new TreeNode(7);
treeNode.left = treeNode2;
treeNode.right = treeNode3;
treeNode2.left = treeNode4;
treeNode2.right = treeNode5;
ArrayList<ArrayList<Integer>> arrayLists = levelOrder1(treeNode);
arrayLists.forEach(System.out::println);
}
/*
* 使用队列来是实现层序遍历
*/
public static ArrayList<ArrayList<Integer>> levelOrder1(TreeNode root) {
ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
if (root == null)
return res;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.offer(root);
while (!queue.isEmpty()) {
ArrayList<Integer> level = new ArrayList<Integer>();
int levelNum = queue.size();
for (int i = 0; i < levelNum; i++) {
if (queue.peek().left != null)
queue.offer(queue.peek().left);
if (queue.peek().right != null)
queue.offer(queue.peek().right);
level.add(queue.poll().val);
}
res.add(level);
}
return res;
}
}
Queue常用方法: