mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-01 03:24:24 +08:00
954c45864b
* docs: add Japanese documents (`ja/docs`) * docs: add Japanese documents (`ja/codes`) * docs: add Japanese documents * Remove pythontutor blocks in ja/ * Add an empty at the end of each markdown file. * Add the missing figures (use the English version temporarily). * Add index.md for Japanese version. * Add index.html for Japanese version. * Add missing index.assets * Fix backtracking_algorithm.md for Japanese version. * Add avatar_eltociear.jpg. Fix image links on the Japanese landing page. * Add the Japanese banner. --------- Co-authored-by: krahets <krahets@163.com>
42 lines
1.4 KiB
Java
42 lines
1.4 KiB
Java
/**
|
||
* File: binary_tree_bfs.java
|
||
* Created Time: 2022-11-25
|
||
* Author: krahets (krahets@163.com)
|
||
*/
|
||
|
||
package chapter_tree;
|
||
|
||
import utils.*;
|
||
import java.util.*;
|
||
|
||
public class binary_tree_bfs {
|
||
/* レベル順走査 */
|
||
static List<Integer> levelOrder(TreeNode root) {
|
||
// キューを初期化し、根ノードを追加
|
||
Queue<TreeNode> queue = new LinkedList<>();
|
||
queue.add(root);
|
||
// 走査順序を格納するリストを初期化
|
||
List<Integer> list = new ArrayList<>();
|
||
while (!queue.isEmpty()) {
|
||
TreeNode node = queue.poll(); // キューのデキュー
|
||
list.add(node.val); // ノードの値を保存
|
||
if (node.left != null)
|
||
queue.offer(node.left); // 左の子ノードをエンキュー
|
||
if (node.right != null)
|
||
queue.offer(node.right); // 右の子ノードをエンキュー
|
||
}
|
||
return list;
|
||
}
|
||
|
||
public static void main(String[] args) {
|
||
/* 二分木を初期化 */
|
||
// 特定の関数を使用して配列を二分木に変換
|
||
TreeNode root = TreeNode.listToTree(Arrays.asList(1, 2, 3, 4, 5, 6, 7));
|
||
System.out.println("\n二分木を初期化\n");
|
||
PrintUtil.printTree(root);
|
||
|
||
/* レベル順走査 */
|
||
List<Integer> list = levelOrder(root);
|
||
System.out.println("\nレベル順走査でのノードの出力順序 = " + list);
|
||
}
|
||
} |