What is a Linked List in Data Structure?
A linked list, in symbol terms, is a linear collection of data elements. Those data elements are called nodes. A linked list can be described as a train or a sequence of nodes, in which is nodes contains one or more data fields and a pointer to the next nodes.
 |
| Linked List |
Operation of linked list:
There are mainly two types of linked list-
one is insertion(insert) and the other is deletion(delete).
Insertion divided into three-part.
Deletion divided into three-part.
Linked List Insertion:
- Insert at the beginning
- Insert at the end
- Insert at the middle
Linked List Deletion:
- Delete at the beginning
- Delete at the end
- Delete at the middle
Our objective comprises in utilizing C++ classes so as to characterize half and half structures. ExcelR Data Science Courses
ReplyDelete