Class LinkedList<T>

Class representing a singly linked list. This list structure allows insertion, search, retrieval by index, and deletion of values.

Type Parameters

T
The type of values stored in the list.

Index

Constructors

Methods

clear delete getAt insert search size toArray

Constructors

constructor

new LinkedList<T>(): LinkedList<T>
Type Parameters
- T
Returns LinkedList<T>

Methods

clear

clear(): void
Clears all nodes from the list, resetting it to an empty state.

Returns void
- Defined in data-structures/linked-list/LinkedList.ts:147

delete

delete(value): void
Deletes the first occurrence of a specified value from the list. Adjusts the head, tail, and next pointers accordingly.
Parameters
- value: T
  The value to delete.
Returns void
- Defined in data-structures/linked-list/LinkedList.ts:98

getAt

getAt(index): T
Retrieves the value at a specified index. Traverses from the head up to the index if within bounds.
Parameters
- index: number
  The index of the value to retrieve.
Returns T
- The value at the specified index, or null if the index is out of bounds.
- Defined in data-structures/linked-list/LinkedList.ts:64

insert

insert(value): void
Inserts a new value at the end of the list. Updates the tail pointer and, if the list was empty, also sets the head.
Parameters
- value: T
  The value to insert.
Returns void
- Defined in data-structures/linked-list/LinkedList.ts:45

search

search(value): boolean
Searches for a value in the list.
Parameters
- value: T
  The value to search for.
Returns boolean
- True if the value is found, otherwise false.
- Defined in data-structures/linked-list/LinkedList.ts:83

size

size(): number
Gets the current number of nodes in the list.

Returns number
- The size of the list.
- Defined in data-structures/linked-list/LinkedList.ts:126

toArray

toArray(): T[]
Converts the list to an array for easy visualization or further processing.

Returns T[]
- An array containing all values in the list.
- Defined in data-structures/linked-list/LinkedList.ts:134