Class CircularLinkedList<T>
A circular linked list implementation.
Inheritance
CircularLinkedList<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class CircularLinkedList<T> : IEnumerable<T>, IEnumerable
Type Parameters
Fields
ReferenceNode
Declaration
public CircularLinkedListNode<T> ReferenceNode
Field Value
Methods
Clear()
Declaration
Delete(T)
search and delete.
Time complexity:O(n).
Declaration
public void Delete(T data)
Parameters
Type |
Name |
Description |
T |
data |
|
Delete(CircularLinkedListNode<T>)
Declaration
public void Delete(CircularLinkedListNode<T> current)
Parameters
GetEnumerator()
Declaration
public IEnumerator<T> GetEnumerator()
Returns
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
IsEmpty()
Declaration
Returns
Union(CircularLinkedList<T>)
Declaration
public void Union(CircularLinkedList<T> newList)
Parameters
Explicit Interface Implementations
IEnumerable.GetEnumerator()
Declaration
IEnumerator IEnumerable.GetEnumerator()
Returns
Implements