feat(linked-list): Implement LinkedLists and Recursive LinkedLists #15
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 introduces three new classes to implement different types of linked lists in Java. The changes include the implementation of
CircularDoubleLinkedList,CircularLinkedList, andDoubleLinkedList, each with their respective methods and innerNodeclasses.New Linked List Implementations:
CircularDoubleLinkedList.java: Implements a circular double linked list with methods for adding, removing, replacing, and accessing elements, as well as utility methods liketoString,clear,reverseData, andcircleTest.CircularLinkedList.java: Implements a circular linked list with similar methods toCircularDoubleLinkedList, but tailored for a singly linked structure. Includes methods for adding, removing, replacing, and accessing elements, along with utility methods liketoString,clear,reverseData, andcircleTest.DoubleLinkedList.java: Implements a double linked list with methods for adding, removing, replacing, and accessing elements, as well as utility methods liketoString,clear,reverseData, andcircleTest.