2024-05-26

tgyuuAn/README.md

@@ -60,4 +60,5 @@
 | 53차시 | 2024.05.09 |  백트래킹  | <a href="https://www.acmicpc.net/problem/12100">2048 (Easy)</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/184
 | 54차시 | 2024.05.14 |  다익스트라  | <a href="https://www.acmicpc.net/problem/9370">미확인 도착지</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/185
 | 55차시 | 2023.05.18 |  유니온 파인드  | <a href="https://www.acmicpc.net/problem/4195">친구 네트워크</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/189
+| 57차시 | 2023.05.26 |  분할 정복  | <a href="https://www.acmicpc.net/problem/2263">트리의 순회</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/197
 ---

tgyuuAn/분할 정복/트리의 순회.py

@@ -0,0 +1,27 @@
+import sys
+
+sys.setrecursionlimit(10**6)
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+in_order = list(map(int,input().split()))
+post_order = list(map(int,input().split()))
+position = [0 for _ in range(N+1)]
+
+for idx, element in enumerate(in_order):
+    position[element] = idx
+
+def divide_and_conquer(in_start, in_end, post_start, post_end):
+    if in_start > in_end or post_start > post_end: return
+
+    in_order_root = post_order[post_end]
+    print(in_order_root, end=" ")
+
+    root_idx = position[in_order_root]
+
+    divide_and_conquer(in_start, root_idx-1, post_start, post_start+(root_idx - in_start) -1)
+    divide_and_conquer(root_idx+1, in_end, post_start+(root_idx - in_start), post_end-1)
+
+    return
+
+divide_and_conquer(0, N-1, 0, N-1)