Introduction to Linked List

In this video, we’re going to start a new topic, Linkedlist
ike arrays, linked lists are also linear data structures but in linked lists elements are not stored at contiguous memory locations. They can be stored anywhere in the memory but for sequential access, the nodes are linked to each other using pointers.

Each element in a linked list consists of two parts:
Data: This part stores the data value of the node. That is the information to be stored at the current node.
Next Pointer: This is the pointer variable or any other variable which stores the address of the next node in the memory.

In this video, you’ll also learn about asymptotic notations, they are basically mathematical notations which represent order of growth of any mathematical function. There are three famous notations which you’ll see in this video, they are big O , Theta , Omega.

Welcome to the first video Tutorial on Data Structures And Algorithms. In this video I am going to provide an Introduction to Data Structures And Algorithms. This Course is created to Explain the Fundamentals of data structures and algorithms. This video Will explain What is data?, What is data structure?, The Need for Data Structures, What is algorithm?

#DataStructures #Algorithms #DSandAlgo #ProgrammingKnowledge

★★★Top Online Courses From ProgrammingKnowledge ★★★

★★★ Online Courses to learn ★★★

★★★ Follow ★★★

DISCLAIMER: This video and description contains affiliate links, which means that if you click on one of the product links, I’ll receive a small commission. This help support the channel and allows us to continue to make videos like this. Thank you for the support!