How to remove all nodes of a linked list in C#

The `Clear()` method

The LinkedList<T> generic class in the System.Collections.Generic namespace provides the Clear() method, which removes all nodes from a linked list in C#.

LinkedList<T> in C# is implemented as a doubly-linked list with insertion and removal as $O(1)$ operations.

The figure below illustrates how the Clear() method works:

Syntax

public void Clear ();

Parameters

This function does not take any parameters.

Return value

The Clear() function does not return a value.

Code

Consider the following example code, where we create a linked list of strings and add the names of a few companies to it.

using System;
using System.Collections.Generic;
class LinkedListClear {
    static void Main() {
        string[] companies = {"Google", "Apple", "Microsoft", "Facebook"};
        LinkedList<string> companyList = new LinkedList<string>(companies);
        Console.WriteLine("LinkedList Elements - Count : {0}", companyList.Count);
        Print(companyList);
        companyList.Clear();
        Console.WriteLine("LinkedList Elements After Clear() - Count : {0}", companyList.Count);
        Print(companyList);
    }
    private static void Print(LinkedList<string> list) { 
        foreach (var node in list) {
            Console.Write(node + ", ");
        }
        Console.WriteLine("\n");     
    }
}

How to remove all nodes of a linked list in C#

The `Clear()` method

Syntax

Parameters

Return value

Code

Explanation

Things to note

How to remove all nodes of a linked list in C#

The Clear() method

Syntax

Parameters

Return value

Code

Explanation

Things to note

The `Clear()` method