Skip to content
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

Fix removing the root node in binary_search_tree.py removes the whole tree #8819

Closed
wants to merge 2 commits into from

Conversation

kartheekkotha
Copy link

@kartheekkotha kartheekkotha commented Jun 14, 2023

Describe your change:

Fixes #8715

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

Checklist:

  • I have read CONTRIBUTING.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 Python files are placed inside an existing directory.
  • All filenames are in all lowercase characters with no spaces or dashes.
  • All functions and variable names follow Python naming conventions.
  • All function parameters and return values are annotated with Python type hints.
  • All functions have doctests that pass the automated testing.
  • All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
  • If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

@algorithms-keeper algorithms-keeper bot added tests are failing Do not merge until tests pass and removed tests are failing Do not merge until tests pass labels Jun 14, 2023
Comment on lines +40 to +43
if self.is_right(node): # If it is the right children
self.root = new_children
else:
self.root = new_children
Copy link
Member

Choose a reason for hiding this comment

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

Why execute the if statement when the code executed is identical either way?

Comment on lines +37 to +39
if (
node == self.root
): # This check if the node is the head and assign the root to the remaining
Copy link
Member

Choose a reason for hiding this comment

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

Please do not wrap line for a comment.

Suggested change
if (
node == self.root
): # This check if the node is the head and assign the root to the remaining
# This check if the node is the head and assigns the root to the remaining
if node == self.root:

@cclauss cclauss changed the title fix issue #8715 Fix removing the root node in binary_search_tree.py removes the whole tree Jun 18, 2023
@CaedenPH
Copy link
Contributor

#8752 also implements the same issue. Which pr should be merged?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Removing the root node in binary_search_tree.py removes the whole tree.
3 participants