2024-02-20 solved

alstjr7437/README.md

@@ -11,3 +11,5 @@
 | 7차시 | 2024.02.08 |  스택  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/12909">올바른 괄호</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/22 |
 | 8차시 | 2024.02.14 |  DP  | <a href="https://www.acmicpc.net/problem/12865">평범한 배낭</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/24 |
 | 9차시 | 2024.02.17 |  그리디  | <a href="https://www.acmicpc.net/problem/2138">전구와 스위치</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/29 |
+| 10차시 | 2024.02.20 |  BFS/DFS  | <a href="https://www.acmicpc.net/problem/11725">전구와 스위치</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/33 |
+

alstjr7437/트리/트리의-부모-찾기.py

@@ -0,0 +1,46 @@
+import sys
+sys.setrecursionlimit(10**8) #재귀 리미트
+from collections import deque
+
+n = int(input())
+
+# 트리 만들기
+tree = {i:[] for i in range(1,n+1)}
+for i in range(n-1):
+    a, b = map(int, input().split())
+    tree[a].append(b)
+    tree[b].append(a)
+# print(tree)
+
+# 부모 저장하기
+visited = [0] * (n+1)
+
+# DFS
+def dfs(a):
+    for i in tree[a]:
+        if visited[i] == 0:
+            visited[i] = a
+            # print(visited, i, a)
+            dfs(i)
+
+# BFS
+def bfs():
+    while queue:
+        a = queue.popleft()
+        for i in tree[a]:
+            if visited[i] == 0:
+                queue.append(i)
+                visited[i] = a
+                # print(visited, queue)
+
+
+visited[1] = '어무이'
+
+# dfs(1)
+
+queue = deque()
+queue.append(1)
+bfs()
+
+for i in range(2, n+1):
+    print(visited[i])