Create binary_search_tree.py #843
Closed
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
poyea
requested changes
Jun 6, 2019
There was a problem hiding this comment.
There're already two binary tree implementations in the repo: one in binary_tree/ and another in data_structures/binary tree/. I see you've a minimum function for it. Would you mind add that to the existing binary tree in data_structures/binary tree/? It's more complete. Thank you.
|
It is binary search tree which is different from normal binary tree. Binary Search Tree has many applications which uses recursion. So this is the most important data structure than normal binary tree. |
|
Stale pull request message |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Implementing basic Binary Search Tree