BinarySearchTree Refactor and Documentation Update (C++) #335
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
The 'Node *insert(Node *, int)' method makes the tree a Binary Search Tree, since it enforces these two properties: - Each node is greater than every node in its left subtree - Each node is less than every node in its right subtree
...like 'delete', 'find min', 'find max'. In addition to that, in this version, object oriented code is present. `BinarySearchTree` is a class, and it has behaviour that operates on the state.
kelvins approved these changes Nov 12, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
2 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.
This pull request refactors the existing 'BinaryTree' to 'BinarySearchTree' in the C++ codebase. The key changes are as follows: