Skip to content

260120 : [BOJ 22856] 트리 순회 #2321

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
sunha20 merged 2 commits into from
Jan 30, 2026
Merged

260120 : [BOJ 22856] 트리 순회 #2321

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d53e46d
add: BOJ22856_트리순회
sunha20 Jan 20, 2026
09b451d
add: endNode 체크 위치 수정
sunha20 Jan 27, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
70 changes: 70 additions & 0 deletions _sunha/BOJ22856_트리순회.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
/** BOJBOJ22856_트리순회
* # 문제
* -
*
* # 제한
*
*
* # 풀이
*
*
*/

import java.io.*;

public class BOJ22856_트리순회 {

static class Node {
int left, right;

void set(int left, int right) {
this.left = left;
this.right = right;
}
}

static int N, cnt, endNode;
static Node[] tree;

public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
N = Integer.parseInt(br.readLine());

String[] temp;
tree = new Node[N+1];
int now;
for (int n=0; n<N; n++){
temp = br.readLine().split(" ");
now = Integer.parseInt(temp[0]);

tree[now] = new Node();
tree[now].set(Integer.parseInt(temp[1]), Integer.parseInt(temp[2]));
}

endNode = 1;
while (tree[endNode].right != -1) {
endNode = tree[endNode].right;
}

travel(1);
}

static void travel(int now) {
cnt++;

if (tree[now].left > 0) {
travel(tree[now].left);
cnt++;
}

if (tree[now].right > 0) {
travel(tree[now].right);
cnt++;
}

if (now == endNode) {
System.out.println(cnt - 1); // 시작점 카운트(1) 제외하고 출력
}

}
}