JavaScript Exercises: Clear a singly linked list by pointing the head towards null

JavaScript Singly Linked List: Exercise-10 with Solution

Empty a SLL

Write a JavaScript program to empty a singly linked list by pointing the head towards null.

Sample Solution:

JavaScript Code:

// Define a class representing a node in a singly linked list
class Node {
    constructor(data) {
        // Initialize the node with provided data
        this.data = data
        // Initialize the next pointer to null
        this.next = null                
    }
}

// Define a class representing a singly linked list
class SinglyLinkedList {
    constructor(Head = null) {
        // Initialize the head of the list
        this.Head = Head
    }

    // Method to add a new node to the end of the list
    add(newNode){
        // Start traversal from the head node
        let node = this.Head;
        // If the list is empty, set the new node as the head and return
        if(node == null){
            this.Head = newNode;
            return;
        }
        // Traverse the list until the last node
        while (node.next) {
            node = node.next;
        }
        // Set the next pointer of the last node to the new node
        node.next = newNode;
    }

    // Method to check if the list is empty
    is_Empty(){
        // Return true if the head is null, indicating an empty list
        return (this.Head == null)
    }

    // Method to empty the list
    empty_list() {
        // Set the head of the list to null, effectively removing all nodes
        this.Head = null;
    }

    // Method to display the elements of the list
    displayList(){
        // Start traversal from the head node
        let node = this.Head;
        // Initialize an empty string to store the elements of the list
        var str = ""
        // Traverse the list and concatenate each element to the string
        while (node) {
            str += node.data + "->";
            node = node.next;
        }
        // Append "NULL" to indicate the end of the list
        str += "NULL"
        // Print the string containing the list elements
        console.log(str);  
    }
}

// Create an instance of the SinglyLinkedList class
let numList = new SinglyLinkedList();
// Add nodes with data values to the list
numList.add(new Node(12));
numList.add(new Node(13));
numList.add(new Node(14));
numList.add(new Node(15));
numList.add(new Node(14));
// Display the elements of the list
console.log("Original Linked list:");
numList.displayList();
// Empty the list
console.log("Empty the said list!");
numList.empty_list();
// Check if the list is empty
console.log("Check the said list is empty or not!");
console.log(numList.is_Empty());

Output:

12->13->14->15->14->NULL
Empty the said list!
Check the said list is empty or not!
true

Flowchart:

Live Demo:

See the Pen javascript-singly-linked-list-exercise-10 by w3resource (@w3resource) on CodePen.

For more Practice: Solve these Related Problems:

• Write a JavaScript function that empties a singly linked list by setting its head pointer to null.
• Write a JavaScript function that pops all nodes from a singly linked list until it is empty.
• Write a JavaScript function that iterates through a singly linked list to remove all its nodes one by one.
• Write a JavaScript function that clears a singly linked list and then verifies by checking its length.

Go to:

• JavaScript Linked List Exercises Home ↩
• JavaScript Exercises Home ↩

PREV : Check if a SLL is empty.
NEXT : Remove the node from a SLL at the specified index.

Improve this sample solution and post your code through Disqus