Skip to content

Commit be4311b

Browse files
committed
[Tree] baekjoon-2263
1 parent ce9a0a5 commit be4311b

File tree

4 files changed

+67
-0
lines changed

4 files changed

+67
-0
lines changed

README.md

+1
Original file line numberDiff line numberDiff line change
@@ -154,6 +154,7 @@
154154
| 02 | | [Baekjoon-1068 트리](./src/Tree/P1068) | |
155155
| 03 | | [SWEA-1233 사칙연산 유효성 검사](./src/Tree/swea1233) | |
156156
| 04 | ⭐️ | [Baekjoon-1167 트리의 지름](./src/Tree/P1167) | |
157+
| 05 | ⭐️ | [Baekjoon-2263 트리의 순회](./src/Tree/P2263) | |
157158

158159
### Heap
159160

src/Tree/P2263/Main.java

+41
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
package Tree.P2263;
2+
3+
import java.io.*;
4+
import java.util.StringTokenizer;
5+
6+
public class Main {
7+
8+
static int n;
9+
static int[] in, post;
10+
static StringBuilder sb = new StringBuilder();
11+
12+
public static void main(String[] args) throws Exception {
13+
System.setIn(new FileInputStream("src/Tree/P2263/input.txt"));
14+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
15+
16+
n = Integer.parseInt(br.readLine());
17+
in = new int[n];
18+
post = new int[n];
19+
20+
StringTokenizer st1 = new StringTokenizer(br.readLine());
21+
StringTokenizer st2 = new StringTokenizer(br.readLine());
22+
for (int i = 0; i < n; i++) {
23+
in[i] = Integer.parseInt(st1.nextToken());
24+
post[i] = Integer.parseInt(st2.nextToken());
25+
}
26+
27+
search(0, n-1, 0, n-1);
28+
System.out.println(sb.toString());
29+
}
30+
31+
static void search(int i_s, int i_e, int p_s, int p_e) {
32+
int root = post[p_e], mid;
33+
sb.append(root).append(" ");
34+
if (i_s == i_e) return;
35+
for (mid = i_s; mid <= i_e; mid++) {
36+
if (in[mid] == root) break;
37+
}
38+
if (i_s <= mid-1) search(i_s, mid-1, p_s, p_s+(mid-i_s)-1);
39+
if (mid < i_e) search(mid+1, i_e, p_s+(mid-i_s), p_e-1);
40+
}
41+
}

src/Tree/P2263/README.md

+12
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
## [baekjoon-2263] 트리의 순회
2+
3+
![image](https://user-images.githubusercontent.com/22045163/108312939-c3763a00-71fa-11eb-8836-289469ba1438.png)
4+
5+
### 풀이 과정
6+
7+
- postorder의 가장 오른쪽은 부모 노드
8+
- inorder는 부모 노드를 중간에 두고 좌, 우로 자식 노드를 가짐
9+
10+
![image](https://user-images.githubusercontent.com/22045163/108312825-a3df1180-71fa-11eb-9c10-dd790fa2602d.png)
11+
12+
![image](https://user-images.githubusercontent.com/22045163/108312955-cec96580-71fa-11eb-868f-6e6e993ddc9e.png)

src/Tree/P2263/input.txt

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
7
2+
4 2 1 5 3 6 7
3+
4 2 5 7 6 3 1
4+
//1243567
5+
6+
7
7+
6 2 5 3 1 4 7
8+
6 5 2 1 7 4 3
9+
//3265417
10+
11+
3
12+
1 2 3
13+
1 3 2

0 commit comments

Comments
 (0)