LinkedList (C#)

LinkedList

A generic doubly linked collection in System.Collections.Generic whose elements are stored in LinkedListNode objects connected through previous and next references. Domain: C# → .NET → System.Collections.Generic → Linked Lists

Doubly Linked List

A linked structure in which each node can reference both the node before it and the node after it.

LinkedListNode

A node object that stores a value in a LinkedList and provides access to neighboring nodes.

node.Value

Gets or sets the value stored in a LinkedListNode.

node.Next

Gets the next node in the LinkedList, or null when the node is the last node.

node.Previous

Gets the previous node in the LinkedList, or null when the node is the first node.

node.List

Gets the LinkedList to which the node currently belongs, or null if the node is not attached to a list.

new LinkedList()

Creates an empty LinkedList.

new LinkedList(collection)

Creates a LinkedList containing elements copied from the specified collection.

list.Count

Gets the number of nodes contained in the LinkedList.

list.First

Gets the first LinkedListNode in the list, or null if the list is empty.

list.Last

Gets the last LinkedListNode in the list, or null if the list is empty.

list.AddFirst(value)

Creates a new node containing the specified value and adds it to the beginning of the LinkedList.

list.AddLast(value)

Creates a new node containing the specified value and adds it to the end of the LinkedList.

list.AddBefore(node, value)

Creates and inserts a new node containing the specified value immediately before a specified existing node.

list.AddAfter(node, value)

Creates and inserts a new node containing the specified value immediately after a specified existing node.

list.Remove(value)

Removes the first node containing the specified value and reports whether such a node was found.

list.Remove(node)

Removes the specified LinkedListNode from the LinkedList.

list.RemoveFirst()

Removes the node at the beginning of the LinkedList.

list.RemoveLast()

Removes the node at the end of the LinkedList.

list.Find(value)

Returns the first node containing the specified value, or null if the value is not found.

list.FindLast(value)

Returns the last node containing the specified value, or null if the value is not found.

list.Contains(value)

Determines whether the LinkedList contains the specified value.

list.Clear()

Removes all nodes from the LinkedList.

LinkedList Has No Indexer

LinkedList does not provide List-style zero-based indexed access such as list[index].

LinkedList Node Insertion

Given a valid node reference, inserting or removing nearby nodes can be performed without shifting all subsequent elements as an array-backed list may require.

LinkedList vs List

List is array-backed and optimized for indexed access, whereas LinkedList is node-based and optimized for operations involving known node positions.