I am implementing a cyclic DoublyLinkedList data structure. Like a singly linked list, nodes in a doubly linked list have a reference to the next node, but unlike a singly linke
You can also use a hash map, and you will get the data on constant time
public T get(int position){ Node node = map.get(position); T dat = node.getData(); return dat; }