12 tree #12
Open
12 tree #12
Conversation
This file contains 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
…Altu-Bitu-HwangJaeEun into 06_greedy_algorithm
sawoll
reviewed
Nov 27, 2023
sawoll
reviewed
Nov 27, 2023
Comment on lines
+52
to
+55
| // 전위 순회 결과로 이진 트리 생성 | ||
| while (cin >> value) { | ||
| root = insertNode(root, value); | ||
| } |
There was a problem hiding this comment.
이진 트리를 먼저 만든 후에 후위 순회를 하는 방법으로 구현해 주셨습니다.👍 이 문제는 전위순회순서로부터 후위 순회 순서를 구하기만 하면 되므로, 이에 집중하여 전위 순회 순서를 입력받은 후 함수에서 이진 트리의 특성을 이용해서 후위 순회 순서를 바로 구하도록 할 수도 있답니다! 이 점도 고려해주시면 좋을 것 같아요!
sawoll
reviewed
Nov 27, 2023
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.
인적사항
학번 : 2176427
이름 : 황재은
과제 제출
기존 제출 : 15681, 5639
추가 제출 : 3190