[20251025] BOJ / G5 / 트리 / 설진영 #1228
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1068
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
트리에서 특정 노드를 삭제했을 때 리프 노드의 개수를 구하는 문제
노드를 삭제하면 그 노드의 모든 자손도 함께 삭제
🔍 풀이 방법
부모자식관계를 인접리스트로 저장하
dfs로 삭제할 노드의 모든 자손을 removed 배열에 표시함
각 노드에서 살아있는 자식이 0개면 리프로 보고, 재귀적으로 개수 합하기
⏳ 회고
ez 루트처리 신경써야할듯