Class AbstractLinkedList<N>Abstract

Core abstract base class for all linked list implementations.

Defines the fundamental contract that all linked lists must fulfill, providing a unified interface for basic list operations.

Example

class MyLinkedList extends AbstractLinkedList {
 // Implement abstract methods
}

Type Parameters

  • N

    The type of the nodes in the list.

Hierarchy (View Summary)

Constructors

constructor

Methods

[iterator] clear nodeAt popNode pushNode shiftNode unshiftNode

Constructors

constructor

Methods

Abstract[iterator]

  • "[iterator]"(reversed: boolean): Generator<N, void, void>

    Returns an iterator for traversing the list. Supports both forward and reverse traversal.

    Parameters

    • reversed: boolean

      If true, the iterator will traverse the list in reverse order.

    Returns Generator<N, void, void>

    An iterator yielding nodes in the specified orders.

Abstractclear

AbstractnodeAt

  • nodeAt(index: number): undefined | N

    Retrieves the node at the specified index.

    Parameters

    • index: number

      The zero-based index of the node to retrieve.

    Returns undefined | N

    The node at the specified index, or undefined if the index is out of bounds.

AbstractpopNode

AbstractpushNode

AbstractshiftNode

AbstractunshiftNode

Settings

Member Visibility

On This Page

Constructors
Methods