Circular Doubly Linked List - Java
This Circular-doubly-linked list project contains the following methods:
- isEmpty[] - true if list is empty, else false
- size[] - returns the size of the list
- find[element] - finds element in the list
- contains[element] - checks whether an element exists in the list
- findPosition[position] - finds a position in the list
- get[element] - gets element from the list
- reset[] - resets the starting location of the list to the head
- add[] - adds new element to the list
- addFront[element] - adds new element to the front of the list
- addBack[element] - adds new element to the back of the list
- addAtPosition[element, position] - adds new element at the specified position
- remove[element] - removes the specified element
- removeFront[] - removes the front element
- removeBack[] - removes the last element
- removeAtPosition[position] - removes the element in the specified position
- toString[] - outputs the elements in the list in forward order
- printReverse[] - outputs the element in the list in reverse order
Circular Doubly Linked List
An implementation of circular doubly linked list C
Circular Doubly Linked-List
Implementasi 'circular doubly linked-list' pake C