know what is linked list and what are its types.
Previous - Merge of two arrays in C
1. Introduction to Data Structures
2. Pointer in C
3. Pointer and Structure in C
4. Linear and Non-Linear Data Structure in C
5. Array Implementation in C
6. Sum of array element in C
7. Addition of two arrays element in C
8. Inverse of an array in C
9. Merge of two arrays in C
10.Overview of Linked List
11.Singly Linked List
12.Doubly Linked List
13.Circular Linked List
14.Count number of nodes
15.Split a list into two equal size list
16.Merge two list into a single list
17.Stack
18.Push and Pop operation of stack.
19.Push and Pop operation of stack using linked list.
20.Queue implementation using array.
21.Queue implementation using linked list.
22.Circular queue implementation using array.
23.Tree data structure
24.Representing Graph using adjacency list & perform DFS & BFS
Linked List
A linked list is a data structure which consists of data record in a sequence such that each data record have a field of data as well as link reference to its connected node. It do not provide the random access to any of its member data as it is form of a indexing and the connected node is pre-defined.
There are mainly three kinds of linked lists:
- Singly linked list
- Doubly linked list
- Circular linked list.
Singly link list:
In the singly link list each node have two fields one for data and other is for link reference of the next node. The node have null only to the last node of the link field. This can be seen in the following picuture.
Fig: Singly Link List
Doubly link list:
In the doubly link list each node have three field two fields for link which is the reference to next and previous and one for data record. The node have null only to the first node of previous and last node at the next. This can be seen in the following picture.
Fig: Doubly Link List
Circular link list:
If talking about singly circular link list each node have two fields one for data record and other for link reference to the next node. The last node has link reference to the first node. There in no null present in the link of any node.
Fig: Singly circular link list
Previous - Merge of two arrays in C
Next - Singly Linked List
Data Structure Tutorial
1. Introduction to Data Structures
2. Pointer in C
3. Pointer and Structure in C
4. Linear and Non-Linear Data Structure in C
5. Array Implementation in C
6. Sum of array element in C
7. Addition of two arrays element in C
8. Inverse of an array in C
9. Merge of two arrays in C
10.Overview of Linked List
11.Singly Linked List
12.Doubly Linked List
13.Circular Linked List
14.Count number of nodes
15.Split a list into two equal size list
16.Merge two list into a single list
17.Stack
18.Push and Pop operation of stack.
19.Push and Pop operation of stack using linked list.
20.Queue implementation using array.
21.Queue implementation using linked list.
22.Circular queue implementation using array.
23.Tree data structure
24.Representing Graph using adjacency list & perform DFS & BFS
0 comments:
Speak up your mind
Tell us what you're thinking... !