Summary Linked List in C++

LINKED LIST NOTES

A linked list is a data structure that consists of a sequence of nodes, where each node
contains a piece of data and a pointer to the next node in the sequence. This data structure
is commonly used in computer programming to implement dynamic data structures, such as
stacks, queues, and associative arrays.

Here's an overview of how to implement a linked list in C++:

Node class:
First, we need to define a class to represent the nodes of the linked list. The class should
have two member variables: a data member to store the data, and a pointer to the next
node in the sequence.

```
class Node {
public:
int data;
Node* next;
};
```

Linked list class:
Next, we need to define a class to represent the linked list itself. The class should have a
pointer to the first node in the sequence (called the "head"), and it should have methods for
adding nodes to the list, removing nodes from the list, and accessing nodes in the list.

```
class LinkedList {
private:
Node* head;
public:
LinkedList();
void addNode(int data);
void deleteNode(int data);
void display();
};
```

Constructor:
The constructor for the LinkedList class should initialize the head pointer to null, indicating
that the list is empty.

```
LinkedList::LinkedList() {
head = nullptr;
}