draw the three (3) types of linked list. Make sure the elements or nodes are related to each other.

Here’s a description of the three types of linked lists along with a visual representation for each.

1. Singly Linked List

A singly linked list consists of nodes where each node has two parts: data and a pointer to the next node.

[Node1] -> [Node2] -> [Node3] -> NULL

2. Doubly Linked List

A doubly linked list consists of nodes where each node has three parts: a pointer to the previous node, data, and a pointer to the next node.

NULL <- [Node1] <-> [Node2] <-> [Node3] -> NULL

3. Circular Linked List

In a circular linked list, the last node points back to the first node, making the list circular.

[Node1] -> [Node2] -> [Node3] --+
  |                             |
  +-----------------------------+

These representations illustrate how the nodes are connected in each type of linked list.