-
Notifications
You must be signed in to change notification settings - Fork 18.7k
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 SplayTree #5142
base: master
Are you sure you want to change the base?
Implement SplayTree #5142
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #5142 +/- ##
============================================
+ Coverage 38.63% 38.94% +0.31%
- Complexity 2379 2417 +38
============================================
Files 516 517 +1
Lines 15385 15469 +84
Branches 2957 2974 +17
============================================
+ Hits 5944 6025 +81
Misses 9157 9157
- Partials 284 287 +3 ☔ View full report in Codecov by Sentry. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What do you think about introducing a method: List<Integer> traverse(TraverseOrder traverseOrder)
, where TraverseOrder
is an enum? This will allow to make the other methods private.
Does your implementation work for duplicated keys?
Please add the missing tests and please update your branch (there were some changes regarding the static analysis).
src/main/java/com/thealgorithms/datastructures/trees/SplayTree.java
Outdated
Show resolved
Hide resolved
src/main/java/com/thealgorithms/datastructures/trees/SplayTree.java
Outdated
Show resolved
Hide resolved
src/main/java/com/thealgorithms/datastructures/trees/SplayTree.java
Outdated
Show resolved
Hide resolved
src/main/java/com/thealgorithms/datastructures/trees/SplayTree.java
Outdated
Show resolved
Hide resolved
src/main/java/com/thealgorithms/datastructures/trees/SplayTree.java
Outdated
Show resolved
Hide resolved
src/main/java/com/thealgorithms/datastructures/trees/SplayTree.java
Outdated
Show resolved
Hide resolved
src/test/java/com/thealgorithms/datastructures/trees/SplayTreeTest.java
Outdated
Show resolved
Hide resolved
cbe94ae
to
626ef44
Compare
The current implementation of the Splay Tree does not handle duplicate keys explicitly. Here are a few possible approaches:
I think the simplest and most used approach is that when inserting a node with a duplicated key, we should update the existing node with the same key. What do you think about these approaches, we will choose the one to implement. |
I think we should not allow duplicate keys and explicitly throw an exception if one is trying to include already existing key. I looked at the existing implementations of BST in this repository and it is a total mess - each implementation reacts differently. |
I have updated the test cases, but there are a few partially covered lines. If you have any suggestion that make the code to be 100% covered, feel free to propose. |
cc5dc27
to
92a4b73
Compare
I have refactored the implementation to disallow inserting duplicated keys and to throw an error if this occurs. I also handle deletion on an empty tree and simplify the deletion process. |
92a4b73
to
37ce557
Compare
if (root == null) { | ||
throw new IllegalArgumentException("Cannot delete from an empty tree"); | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please add an isEmpty
method. Otherwise using this class might be very annoying.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think we can define the isEmpty
method and use it to check the entire tree's root
and continue using root == null
checks within recursive calls because root
is a local variable that represents the current node being processed in the recursion.
switch (traverseOrder) { | ||
case IN_ORDER: | ||
inOrderRec(root, result); | ||
break; | ||
case PRE_ORDER: | ||
preOrderRec(root, result); | ||
break; | ||
case POST_ORDER: | ||
postOrderRec(root, result); | ||
break; | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please add default
(cf. #5179).
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks
- Do not allow duplicate keys and explicitly throw an exception if one is trying to include already existing key - Throw error on deletion if tree is empty - Performing the splay operation before recursion, ensuring that the node to be deleted is at the root or very close to it, simplifying the deletion process.
- inner assignments should be avoided
- Add `isEmpty` method to check to check the entire tree root and continue using `root == null` checks within recursive calls - Add default branch to switch statement
Each variable declaration must be in its own statement. [MultipleVariableDeclarations]
63179e3
to
3e1353f
Compare
clang-format -i --style=file path/to/your/file.java