Lower branches in red-black tree #58
Merged
Conversation
This file contains 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
steven1lung
force-pushed
the
rbtree
branch
2 times, most recently
from
345c9ec
to
f92b93e
Compare
jserv
reviewed
Sep 26, 2022
The changes in this commit are aiming to remove if statements to achieve better performance by producing less branches. Indirect pointers are used to store the pointer pointing to the left or right child node. So we would not need to check whether it is a right or left node.
|
Code updated, please check. |
|
Thank @steven1lung for contributing! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
The changes in this commit are aiming to remove if statements to achieve better performance by producing less branches.
Indirect pointers are used to store the pointer pointing to the left or right child node. So we would not need to check whether it is a right or left node.