Link List Traversal Using Recusrion

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/data-structures/linked-list/sll-basics-standard-operations/asset-link-list-traversal-using-recusrion after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test): Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Domain Test): Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the algorithmic concept of traversing a linked list using recursion. The instructor begins by stating the problem: writing pseudo-code where a pointer head points to the first node. He displays a C-style function What that accepts a node pointer. The core logic involves a conditional check if head is not NULL. Inside the block, the code prints the data of the current node using Printf and then makes a recursive call What head next. To illustrate this, he draws a linked list containing nodes labeled a, b, c, and d. He traces the execution, showing how the function processes the first node, then moves to the second, and so on, until the list ends.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the specific question displayed on the screen: Write a pseudo code for Traversing a link list recursively, where pointer head have the address of the first node of the list. He then presents the solution code, defining a main function that calls What head and the What function itself. The function checks if head is not NULL. If the condition is met, it executes a print statement for the data and calls itself with the next pointer. He draws a visual representation of a linked list with four nodes containing values a, b, c, and d to serve as a concrete example for the trace.

  2. 2:00 – 3:01 02:00-03:01

    The instructor deepens the explanation by drawing a recursion tree to visualize the call stack. He writes w a at the top, branching down to w b, then w c, w d, and finally w NULL. He underlines the two critical lines of code: the print statement and the recursive call, emphasizing that printing happens before the recursive step. He explains that the recursion terminates when the head pointer becomes NULL, preventing infinite loops. This visual aid helps students understand the sequential nature of the traversal and the base case required to stop the recursion.

The lecture successfully demonstrates recursive traversal by combining code analysis with visual tracing. The instructor moves from the abstract problem statement to concrete code, then to a data structure diagram, and finally to a recursion tree. This progression helps students visualize how the function call stack grows and shrinks as it moves through the list. The emphasis on the order of operations—printing data before recursing—highlights the pre-order nature of this specific traversal method.

Loading lesson…