Show / Hide Table of Contents

    Class CircularLinkedList<T>

    A circular linked list implementation.

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

    Fields

    ReferenceNode

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

    Methods

    Clear()

    Time complexity: O(1).

    Declaration
    public void Clear()

    Delete(T)

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

    Declaration
    public void Delete(T data)
    Parameters
    Type Name Description
    T data

    Delete(CircularLinkedListNode<T>)

    Time complexity: O(1)

    Declaration
    public void Delete(CircularLinkedListNode<T> current)
    Parameters
    Type Name Description
    CircularLinkedListNode<T> current

    GetEnumerator()

    Declaration
    public IEnumerator<T> GetEnumerator()
    Returns
    Type Description
    IEnumerator<T>

    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>

    IsEmpty()

    Time complexity: O(1).

    Declaration
    public bool IsEmpty()
    Returns
    Type Description
    Boolean

    Union(CircularLinkedList<T>)

    Time complexity: O(1).

    Declaration
    public void Union(CircularLinkedList<T> newList)
    Parameters
    Type Name Description
    CircularLinkedList<T> newList
    Back to top Generated by DocFX