Lec-20: Traversing in Linked list | Data Structure

👉Subscribe to our new channel:   / @varunainashots  

A linked list is a linear data structure that needs to be traversed starting from the head node until the end of the list. Unlike arrays, where random access is possible, linked list requires access to its nodes through sequential traversal. Traversing a linked list is important in many applications. For example, we may want to print a list or search for a specific node in the list. Or we may want to perform an advanced operation on the list as we traverse the list. The algorithm for traversing a list is fairly trivial.

0:00 - Introduction
0:45 - Traversing
5:27 - Internal working of Traversing
6:50 - Pseudo code
a. Start with the head of the list. Access the content of the head node if it is not null.
b. Then go to the next node(if exists) and access the node information
c. Continue until no more nodes (that is, you have reached the last node)

►Data Structure (Complete Playlist):
   • Data Structure  

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
   • Operating System (Complete Playlist)  
►Database Management System:
   • DBMS (Database Management system) Complete...  
► Theory of Computation
   • TOC(Theory of Computation)  
►Artificial Intelligence:
   • Artificial Intelligence (Complete Playlist)  
►Computer Networks (Complete Playlist):
   • Computer Networks (Complete Playlist)  
►Computer Architecture (Complete Playlist):
   • Computer Organization and Architecture (Co...  
►Structured Query Language (SQL):
   • Structured Query Language (SQL)  
►Discrete Mathematics:
   • Discrete Mathematics  
►Compiler Design:
   • Compiler Design (Complete Playlist)  
►Number System:
   • Number system  
►Cloud Computing & BIG Data:
   • Cloud Computing (Complete Course)  
►Software Engineering:
   • Software Engineering  
►Design and Analysis of algorithms (DAA) (Complete Playlist):
   • Design and Analysis of algorithms (DAA)  
►Graph Theory:
   • Graph Theory  
►Programming in C:
   • C Programming  
►Digital Logic:
   • Digital Logic (Complete Playlist)  

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on YouTube:    / gatesmashers  
►Subscribe to our new channel:    / @varunainashots  
► Like our page on Facebook:   / gatesmashers  
► Follow us on Instagram:   / gate.smashers  
► Follow us on Instagram:   / varunainashots  
► Follow us on Telegram: https://t.me/gatesmashersofficial
► Follow us on Threads: https://www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com