Details
-
Bug
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
-
None
Description
The findInsertionPosition(k) method returns the node such that the node key value is >= k and the previous node (if it exists) is < k.
For edge case: where k is bigger than all the node key values, this should return NIL, but instead it incorrectly returns the node having the biggest key value (which is still < k).