Skip to content

Conversation

sounmind
Copy link
Member

No description provided.

@sounmind sounmind changed the title solve: same tree [Evan] Week 3 May 13, 2024
Copy link
Contributor

Choose a reason for hiding this comment

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

Reason을 밑에 넣어주니 훨씬 보기 좋네요. 저도 참고하겠습니다!

*
* In the best case, where the tree is balanced, the height h is log(n),
* leading to a space complexity of O(log(n)).
*/ No newline at end of file
Copy link
Contributor

Choose a reason for hiding this comment

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

요것만 마지막 줄 공백이 없네용.

Copy link
Member Author

Choose a reason for hiding this comment

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

오오, 추가했습니다. 찾아주셔서 감사해요ㅎㅎ

@sounmind sounmind marked this pull request as ready for review May 18, 2024 02:29
Copy link
Contributor

@SamTheKorean SamTheKorean left a comment

Choose a reason for hiding this comment

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

고생많으셨습니다!!

@SamTheKorean SamTheKorean merged commit 14c0fa3 into DaleStudy:main May 18, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
No open projects
Status: Done
Development

Successfully merging this pull request may close these issues.

2 participants