Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

feat: add tests for binary search trees#1769

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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Conversation

ridge-kimani
Copy link
Contributor

@ridge-kimaniridge-kimani commentedJan 7, 2025
edited
Loading

Open in Gitpod know more

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?
  • Update tests

Checklist:

  • I have readCONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new JavaScript files are placed inside an existing directory.
  • All filenames should use the UpperCamelCase (PascalCase) style. There should be no spaces in filenames.
    Example:UserProfile.js is allowed butuserprofile.js,Userprofile.js,user-Profile.js,userProfile.js are not
  • All new algorithms have a URL in their comments that points to Wikipedia or another similar explanation.
  • If this pull request resolves one or more open issues then the commit message containsFixes: #{$ISSUE_NO}.

@ridge-kimaniridge-kimaniforce-pushed thefeat/binary-search-tree-specs branch from2877788 toeb71e2eCompareJanuary 7, 2025 18:23
return found.value
if (this.root) {
const found = this.root.search(val)
if (found !== null) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others.Learn more.

Just a shorthand recommendation.
Checking forif(found) { will check for not null and not undefined .
So no need to explicitly use if (found !== null) {

Copy link
ContributorAuthor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others.Learn more.

The search return value can only benull or aNode, hence the implicit check.

search(val){if(this.value===val){returnthis}elseif(val<this.value&&this.left!==null){returnthis.left.search(val)}elseif(val>this.value&&this.right!==null){returnthis.right.search(val)}returnnull}

@raklaptudirmraklaptudirm merged commit1d252d7 intoTheAlgorithms:masterJan 15, 2025
3 checks passed
Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment
Reviewers

@appgurueuappgurueuAwaiting requested review from appgurueuappgurueu is a code owner

@anandfreshanandfreshAwaiting requested review from anandfresh

@raklaptudirmraklaptudirmAwaiting requested review from raklaptudirmraklaptudirm is a code owner

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

3 participants
@ridge-kimani@anandfresh@raklaptudirm

[8]ページ先頭

©2009-2025 Movatter.jp