Update README.md #3391
Open
Update README.md #3391
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
Move [0116 - Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) from the "Binary Search" section to "Trees" section, as it is not a problem that uses Binary Search. This is a Tree problem, so it belongs in "Trees", along with some pointer manipulation reminiscent of linked list problems.
|
This is a proposal to move (also on Neetcode.io) the problem 0116 - Populating Next Right Pointers In Each Node from the "Binary Search" section to the "Trees" section. No binary search method is used as it is a DFS Tree traversal with pointer manipulation (or a possible BFS solution). |
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.
Move 0116 - Populating Next Right Pointers In Each Node from the "Binary Search" section to "Trees" section, as it is not a problem that uses Binary Search. This is a Tree problem, so it belongs in "Trees", along with some pointer manipulation reminiscent of linked list problems.
Important
Please make sure the file name is lowercase and a duplicate file does not already exist before merging.