Singly, Doubly and Circular Linked List
![Image](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgkPqxWnBVXfoxbfVhr6T7zq9k8OrsD_Y3m63nwAZib8p_kHHAYVzpDiBIV-ZiNh2fW5IxfkfxHCIL-2TUA2Ev1tHHa0NKmgngQvShAnM31vSEK4Z_pKH-FU_XWJDV27mtU9iX-O_lYAXg/w682-h264/Singly+Linked+List.jpg)
So far, we have seen the implementation of Linked List. The Link List we implemented in the Lined List article was actually Singly Lined List. There is slightly difference between Singly, Doubly and Circular Linked List. We will see the difference and the importance of each in detail in this article. Singly Linked List: In singly linked list, we keep head node in our linked list class. This head node is actually the starting point of our linked list. As shown: The above Figure shows the representation of Singly Linked List. We have a head node in our linked list class, it is the starting point of our linked list. Every node has some data and next pointer of type Node, that point to the next node of the list. Now I will tell you what is doubly linked list an why we need it. Doubly Linked List: In node of singly linked list, we have only one pointer of type node but in doubly linked list we have two pointers of type node. They are generally named as next and previous. The next point...