Adding AVL Tree implementation #200
Merged
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
Contributor Author
| Hello @StepfenShawn, could I ask you to have a look at this PR, whenever you have a few minutes? |
Member
| I'm drowning in a computer competition in this week. So I'll review and debug your code in next week. |
Contributor Author
Amazing! Thank you and best of luck! |
This comment was marked as duplicate.
This comment was marked as duplicate.
Sorry, something went wrong.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
3 participants
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.
As per title, this MR aims to add a Ruby implementation of an AVL tree with distinct key nodes.
This is a special case of a binary search tree where self-balancing is implemented upon insertion and deletion, allowing to keep the tree balanced.
Due to self-balancing upon key insertion and deletion, the main operations of this data structure (insertion, deletion, membership) run - in worst case - in
O(log(n)), wherenis the number of nodes in the tree.Traversal methods (pre-order, in-order, post-order) with custom consumer as argument are also exposed.