Skip to content
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

Update README.md #3391

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

Update README.md #3391

wants to merge 1 commit into from

Commits on Apr 11, 2024

  1. Update README.md 

    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.
    @qxzsilver1
    qxzsilver1 authored Apr 11, 2024
    Configuration menu
    Copy the full SHA
    dbbc59c View commit details
    Browse the repository at this point in the history