-
Notifications
You must be signed in to change notification settings - Fork 126
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.
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
[KwonNayeon] Week 2 #716
[KwonNayeon] Week 2 #716
Conversation
if not preorder or not inorder: | ||
return None | ||
|
||
root = TreeNode(preorder[0]) | ||
mid = inorder.index(preorder[0]) | ||
|
||
root.left = self.buildTree(preorder[1:mid+1], inorder[:mid]) | ||
root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:]) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
파이썬과 재귀함수가 조합이 잘 된것 같습니다!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@TonyKim9401 님 리뷰 감사합니다!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
2주차 문제풀이도 고생 많으셨습니다!
파이썬 활용이 너무 잘 된것 같습니다.
3주차도 파이팅입니다!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.