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.

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

[Bug] Binary Search Tree Deletion #10

Open
nickzuber opened this issue Dec 12, 2016 · 0 comments
Open

[Bug] Binary Search Tree Deletion #10

nickzuber opened this issue Dec 12, 2016 · 0 comments
Assignees
@nickzuber
Labels
bug good first issue

Comments

@nickzuber
Copy link
Owner

I'm 100% sure I accidentally implemented this wrong for two children nodes — should fix. Algorithm should be something like:

find node to delete
  if has two children
  _node := max in left subtree || min in right subtree
  swap values
  delete _node
@nickzuber nickzuber added the bug label Dec 12, 2016
@nickzuber nickzuber self-assigned this Dec 12, 2016
@nickzuber nickzuber changed the title [Bug] Binary Search Tree Deletion Bug - Binary Search Tree Deletion Dec 22, 2016
@nickzuber nickzuber changed the title Bug - Binary Search Tree Deletion [Bug] Binary Search Tree Deletion Dec 26, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@nickzuber nickzuber

Labels
bug good first issue
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@nickzuber