Skip to content

[reeseo3o] WEEK 12 Solutions #2611

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
reeseo3o merged 1 commit into from
May 23, 2026
Merged

[reeseo3o] WEEK 12 Solutions #2611

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
10 changes: 10 additions & 0 deletions same-tree/reeseo3o.js
View file
Open in desktop
Copy link
Copy Markdown
Contributor

@dalestudy dalestudy Bot May 23, 2026

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

🏷️ 알고리즘 패턴 분석

  • 패턴: DFS
  • 설명: 이 코드는 재귀를 이용하여 트리의 노드를 깊이 우선 탐색하며 두 트리의 구조와 값을 비교하는 DFS 패턴에 속합니다.

📊 시간/공간 복잡도 분석

유저 분석 실제 분석 결과
Time O(n) O(n) ✅
Space O(n) O(h) ❌

피드백: 트리의 모든 노드를 방문하는 재귀 방식으로, 최악의 경우 트리의 높이만큼의 호출 스택 공간이 필요하며, 시간 복잡도는 노드 수에 비례합니다.

개선 제안: 현재 구현이 적절해 보입니다.

Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
// Time Complexity: O(n)
// Space Complexity: O(n)
const isSameTree = (p, q) => {
if (p === null && q === null) return true;

if (p === null || q === null) return false;
if (p.val !== q.val) return false;

return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
};
Loading