public static void levelOrder(Node root) { // 层序遍历
Queue<Node> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
Node cur = queue.poll();
System.out.print(cur.val + " ");
if (cur.left != null) {
queue.offer(cur.left);
}
if (cur.right != null) {
queue.offer(cur.right);
}
}
}
二叉树的层序遍历
最新推荐文章于 2023-09-20 20:05:30 发布