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

Implement AVL tree #6

Merged
merged 3 commits into from
Apr 4, 2023
Merged

Implement AVL tree #6

merged 3 commits into from
Apr 4, 2023

Conversation

nemakin
Copy link
Contributor

@nemakin nemakin commented Apr 3, 2023

Implemented AVL tree and refactored classes with nodes it inherits from

@nemakin nemakin closed this Apr 3, 2023
@nemakin nemakin reopened this Apr 3, 2023
@nemakin nemakin changed the base branch from main to dev April 3, 2023 21:36
@ancavar ancavar merged commit cf8e545 into dev Apr 4, 2023
SurfaceYellowDuck added a commit that referenced this pull request Apr 6, 2023
* add insert method and private recursiveInsert method to BinarySearchTree class

* add find method and private search method is BinarySearchTree class

* fix: remove value parameter from Tree interface

* fix: change search function to protected and so that it can be used from any derived tree

* Implement AVL tree (#6)

* feat: Add AVL tree with own BST implementation

* feat: implement better red-black tree methods and tests for it

* Create LICENSE

* fix: change insert method

* fix: change tests

* repo: add CI

* feat: implement remove method and test for it

* fix: band-aid fix for removal

* add readme from main
---------

Co-authored-by: Danil P <58734659+ancavar@users.noreply.github.com>
Co-authored-by: ancavar <danaj2004@yandex.ru>
Co-authored-by: Nikita Nemakin <88817918+nemakin@users.noreply.github.com>
@ancavar ancavar deleted the avl branch April 30, 2023 21:54
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.

2 participants