Skip to content

Update the pattern of 0116-populating-next-right-pointers-in-each-node #3148

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

Jump to bottom
Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update the pattern of 0116-populating-next-right-pointers-in-each-node #3148

wants to merge 1 commit into from

Conversation

@argusherd
Copy link

@argusherd argusherd commented Dec 2, 2023

  • File(s) Modified: .problemSiteData.json
  • Language(s) Used: -
  • Submission URL: -

leetcode 116: https://leetcode.com/problems/populating-next-right-pointers-in-each-node/description/
i think this problem has nothing to do with binary search; it should be about trees instead.
@argusherd
Update .problemSiteData.json
f8403a0 
change the pattern of 0116
@a93a a93a requested a review from neetcode-gh December 3, 2023 09:25
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

1 participant

@argusherd