solve: P07_07_이진트리탐레벨탐색BFS

showpointer · showpointer · commit 523e2fc32fc9 · 2021-10-30T21:40:45.000+09:00
diff --git a/java/inflearn/problemsolving/p07_recursive_tree_graph/P07_07_이진트리탐레벨탐색BFS.java b/java/inflearn/problemsolving/p07_recursive_tree_graph/P07_07_이진트리탐레벨탐색BFS.java
@@ -0,0 +1,41 @@
+package inflearn.problemsolving.p07_recursive_tree_graph;
+
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class P07_07_이진트리탐레벨탐색BFS {
+    Node root;
+
+    void BFS (Node root) {
+        Queue<Node> q = new LinkedList<>();
+        q.offer(root);
+
+        int L = 0;
+        while(!q.isEmpty()) {
+            int len = q.size();
+            System.out.print(L + " : ");
+            for (int i = 0; i < len; i++) {
+                Node cur = q.poll();
+                System.out.print(cur.data + " ");
+                if (cur.lt != null) q.offer(cur.lt);
+                if (cur.rt != null) q.offer(cur.rt);
+            }
+            L++;
+            System.out.println();
+        }
+    }
+
+    public static void main(String[] args) {
+        P07_07_이진트리탐레벨탐색BFS tree = new P07_07_이진트리탐레벨탐색BFS();
+        tree.root = new Node(1);
+        tree.root.lt = new Node(2);
+        tree.root.rt = new Node(3);
+        tree.root.lt.lt = new Node(4);
+        tree.root.lt.rt = new Node(5);
+        tree.root.rt.lt = new Node(6);
+        tree.root.rt.rt = new Node(7);
+
+        tree.BFS(tree.root);
+    }
+}
