Objective:

The purpose of this assignment is to develop a deep understanding of how a Linked List data structure works by implementing its functionality from scratch. You will create a Singly Linked List and perform various operations on it$.$

Part $1$: Singly Linked List Implementation

$1.$ Create a Node Class:

$-$ Each node should contain:

$-$ A data field to store the value.

$-$ A pointer to the next node.

$2.$ Create a LinkedList Class:

$-$ The LinkedList class should have:

$-$ A head node $($initially null$).$

$-$ Methods to manipulate the linked list.

Part $2$: Required Operations

Implement the following methods in the LinkedList class:

Insert at the Beginning:

Add a new node at the start of the list.

Insert at the End:

Add a new node at the end of the list.

Delete a Node by Value:

Remove the first node that contains the given value.

Search for a Node:

Check if a value exists in the list.

Display the List:

Print all elements in the list.

Part $3$: Assignment Questions

Pictorial and Practical Tasks:

Create a linked list and add elements: $10,20,30,$ and $40$ at the end. Insert $5$ at the beginning of the list. Delete the element $20$ from the list. Search for the element $30$ in the list. Display the linked list after each operation.