Introduction:
In computer science, a linked list is one of the fundamental dynamic data structures used in computer programming. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references (“links”) pointing to the next and/or previous
nodes.
A linked list is a self-referential data type because it contains a link to another data of the same type. Linked lists permit insertion and removal of nodes at any point in the list in constant time, but do not allow random access.
Types of Linked Lists:
Basically we can put linked lists into the following…
1. Single Linked List.
2. Circular Single Linked List.
3. Double Linked List.
4. Circular Double Linked List.
Advantages of linked lists:
- Linked lists are dynamic data structures. i.e., they can grow or shrink during the execution of a program.
- Linked lists have efficient memory utilization. Memory is allocated whenever it is required and it is de-allocated (removed) when it is no longer needed.
- Insertion and Deletions are easier and efficient.
- Many complex applications can be easily carried out with linked lists.
Disadvantages of linked lists:
- It consumes more space.
- Searching a particular element in list is difficult .
- Time consuming.
- Reverse Traversing is difficult in linked list.
To learn Data Structure at TCCI in Bopal and Satellite, Ahmedabad.
Call us @ 98256 18292.
Visit us @ http://tccicomputercoaching.com/
tccicomputercoaching 