-
-
Notifications
You must be signed in to change notification settings - Fork 47k
Binary search tree #12778
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 our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Binary search tree #12778
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper
commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper review
to trigger the checks for only added pull request files@algorithms-keeper review-all
to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
The right child node. | ||
""" | ||
|
||
def __init__(self, key: int): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: __init__
. If the function does not return a value, please provide the type hint as: def function() -> None:
Returns a list of keys representing the in-order traversal of the BST. | ||
""" | ||
|
||
def __init__(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: __init__
. If the function does not return a value, please provide the type hint as: def function() -> None:
""" | ||
self.root = None | ||
|
||
def insert(self, key: int) -> None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function insert
else: | ||
self._insert_recursive(self.root, key) | ||
|
||
def _insert_recursive(self, node: BSTNode, key: int) -> None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function _insert_recursive
else: | ||
self._insert_recursive(node.right, key) | ||
|
||
def search(self, key: int) -> BSTNode: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function search
else: | ||
return self._search_recursive(node.right, key) | ||
|
||
def delete(self, key: int) -> None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function delete
""" | ||
self.root = self._delete_recursive(self.root, key) | ||
|
||
def _delete_recursive(self, node: BSTNode, key: int) -> BSTNode: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function _delete_recursive
node.right = self._delete_recursive(node.right, temp.key) | ||
return node | ||
|
||
def _find_min(self, node: BSTNode) -> BSTNode: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function _find_min
current = current.left | ||
return current | ||
|
||
def inorder_traversal(self) -> list: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function inorder_traversal
self._inorder_recursive(self.root, result) | ||
return result | ||
|
||
def _inorder_recursive(self, node: BSTNode, result: list) -> None: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
As there is no test file in this pull request nor any test function or class in the file tree/binary_search_tree.py
, please provide doctest for the function _inorder_recursive
Describe your change:
Checklist: