Basic Terminologies of Linked List
- Head: The Head of a linked list is a pointer to the first node or reference of the first node of linked list. This pointer marks the beginning of the linked list.
- Node: Linked List consists of a series of nodes where each node has two parts: data and next pointer.
- Data: Data is the part of node which stores the information in the linked list.
- Next pointer: Next pointer is the part of the node which points to the next node of the linked list.
Introduction to Linked List – Data Structure and Algorithm Tutorials
Linked List is basically chains of nodes where each node contains information such as data and a pointer to the next node in the chain. It is a popular data structure with a wide range of real-world applications. In this article, we will provide a complete introduction of Linked List, which will help you tackle any problem based on Linked List.
Table of Content
- What is a Linked List?
- Basic Terminologies of Linked List
- Importance of Linked List
- Types of Linked List
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Implementation of Linked List
- Linked List vs. Array
- Advantages of Linked List
- Disadvantages of Linked List
- Applications of Linked List
- Frequently Asked Questions (FAQs) about Linked list