Skip to content

Added BST #49

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
Merged
merged 12 commits into from
Oct 8, 2019
Merged

Added BST #49

merged 12 commits into from
Oct 8, 2019

Conversation

ashokdey
Copy link
Member

@ashokdey ashokdey commented Oct 8, 2019 •
edited
Loading

🌴 So what's Inside?

  • Implementation for Node of BST
  • Implementation of Binary Search Tree(BST)
    • Insertion
    • Pre-order Traversal
    • In-order Traversal
    • Post-order Traversal

Update I:
Added search(root, value) & isEmpty()

Notes

  • All the traversals return an array so as to facilitate easy testing and usability
  • Test Runs are commented out in the main file

@ashokdey ashokdey requested a review from TheSTL October 8, 2019 09:02
@ashokdey ashokdey self-assigned this Oct 8, 2019
TheSTL
TheSTL approved these changes Oct 8, 2019
View reviewed changes
Copy link
Member

@TheSTL TheSTL left a comment

Choose a reason for hiding this comment

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

💯

@ashokdey ashokdey merged commit 1cd6613 into master Oct 8, 2019
@ashokdey ashokdey deleted the problems branch October 8, 2019 09:42
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@TheSTL TheSTL TheSTL approved these changes

Assignees

@ashokdey ashokdey

Labels
new-data-structure strict-review
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@ashokdey @TheSTL