Class CircularLinkedList<T>

A circular linked list implementation.

Inheritance
Object
CircularLinkedList<T>
Implements
Inherited Members
Namespace: Advanced.Algorithms.DataStructures
Assembly: Advanced.Algorithms.dll
Syntax
public class CircularLinkedList<T> : IEnumerable<T>, IEnumerable
Type Parameters
Name Description
T

Fields

| Improve this Doc View Source

ReferenceNode

Declaration
public CircularLinkedListNode<T> ReferenceNode
Field Value
Type Description
CircularLinkedListNode<T>

Methods

| Improve this Doc View Source

Clear()

Time complexity: O(1).

Declaration
public void Clear()
| Improve this Doc View Source

Delete(T)

search and delete. Time complexity:O(n).

Declaration
public void Delete(T data)
Parameters
Type Name Description
T data
| Improve this Doc View Source

Delete(CircularLinkedListNode<T>)

Time complexity: O(1)

Declaration
public void Delete(CircularLinkedListNode<T> current)
Parameters
Type Name Description
CircularLinkedListNode<T> current
| Improve this Doc View Source

GetEnumerator()

Declaration
public IEnumerator<T> GetEnumerator()
Returns
Type Description
IEnumerator<T>
| Improve this Doc View Source

Insert(T)

Marks this data as the new reference node after insertion. Like insert first assuming that current reference node as head. Time complexity: O(1).

Declaration
public CircularLinkedListNode<T> Insert(T data)
Parameters
Type Name Description
T data
Returns
Type Description
CircularLinkedListNode<T>
| Improve this Doc View Source

IsEmpty()

Time complexity: O(1).

Declaration
public bool IsEmpty()
Returns
Type Description
Boolean
| Improve this Doc View Source

Union(CircularLinkedList<T>)

Time complexity: O(1).

Declaration
public void Union(CircularLinkedList<T> newList)
Parameters
Type Name Description
CircularLinkedList<T> newList

Explicit Interface Implementations

| Improve this Doc View Source

IEnumerable.GetEnumerator()

Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Type Description
IEnumerator

Implements