Module `python_datastructures.circularList`

Circular linked list is a datastructure where every node points to its next node in the sequence but the last node points to the first node in the list. A circular linked list is a sequence of elements in which every element has a link to its next element in the sequence and the last element has a link to the first element.

Classes

class CircularList

Methods

def add(self, value): Add element to tail end circular list.
def getCurrent(self): Get current position in the list.
def getHead(self): Get referance to head node in circular list.
def getHeadValue(self): Get value of head in circular list.
def getNext(self): Get next value in the circular list
def getPrevious(self): Get previous value in the circular list
def getSize(self): Get size of the circular list.
def getTail(self): Get referance to tail node in circular list.
def getTailValue(self): Get value of tail in circular list.
def isEmpty(self): Check if circular list is empty.
def remove(self): Remove element at head end circular list.

class Node (value)