Skip to content

Add Binary Search Tree Implementation. #2093

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
Nishithaaa0905 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add Binary Search Tree Implementation. #2093

Nishithaaa0905 wants to merge 1 commit into from
+71 −0

Conversation

@Nishithaaa0905
Copy link

@Nishithaaa0905 Nishithaaa0905 commented Dec 3, 2025

This pull request adds a beginner-friendly implementation of a Binary Search Tree (BST) in JavaScript.

Features included:

  • insert(value): Adds a new value to the tree
  • search(value): Checks if a value exists in the tree
  • inOrderTraversal(): Returns all values in sorted order

This implementation is designed to help beginners understand how BSTs work and practice basic tree operations.
Example usage is included for clarity.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

1 more reviewer

@andrzejsydor andrzejsydor andrzejsydor approved these changes

Reviewers whose approvals may not affect merge requirements

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

2 participants

@Nishithaaa0905 @andrzejsydor