Fix: Correct CLL display and insertion logic #1483
Open
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 commit addresses two issues in the Circularly Linked List (CLL) implementation:
Potential infinite loop in
display()
: Thedisplay()
method had a conditional check (if (node.next != null)
) before advancing the node pointer. This check was redundant in a CLL and could lead to an infinite loop ifnode.next
washead
(e.g. in a single-element list). The condition has been removed, andnode = node.next
is now unconditional within the loop.Bug in
insert()
for single-element lists: When inserting the first element into an empty list, thenode.next = head
assignment was missing, meaning the list wasn't actually made circular. This caused aNullPointerException
whendisplay()
was called on such a list. Theinsert()
method has been corrected to ensurenode.next = head
is set when the first element is added.A
main
method with test cases for thedisplay()
method (empty list, single-element list, multi-element list) has been added toCLL.java
to verify the fixes and ensure correct behavior.