Reversing a Link List using Recursion

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/data-structure-it-specialist/linked-list/structure-modification-pointer-logic/asset-reversing-a-link-list-using-recursion after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, 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), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): 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
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): 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
  14. Compiler Design (IT Specialist): Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): 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
  17. Descriptive Test (Main Exam): English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed walkthrough of reversing a singly linked list using a recursive algorithm in C. The instructor begins by presenting the code structure, specifically the `main` function calling `reverse(null, head)` and the recursive `reverse` function definition. He explains the two-pointer approach where `previous` and `current` are passed down the recursion stack. The core of the lesson involves a step-by-step trace of the execution on a list containing nodes 'a', 'b', 'c', and 'd', demonstrating how the call stack builds up and then unwinds to update the pointers in reverse order.

Chapters

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

    The instructor introduces the problem of reversing a linked list and displays the C code on the screen. He highlights the `main` function calling `reverse(null, head)` and the function signature `Void reverse(struct node* previous, current)`. He explains the logic: if `current` is not null, it recursively calls itself with `current` as the new `previous` and `current->next` as the new `current`. The base case is when `current` is null, at which point `Head` is set to `previous`. The instructor begins tracing the execution, writing down the call stack: `reverse(null, 10)`, `reverse(10, 20)`, `reverse(20, 30)`, and `reverse(30, 40)`, representing the addresses of nodes 'a', 'b', 'c', and 'd' respectively.

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

    The lecture continues with the base case execution and the unwinding phase. The instructor shows the final recursive call `reverse(40, null)`, where the condition `current != null` fails, triggering the `Else` block to set `Head = 40`. As the recursion returns, the line `Current->link = previous` executes. He traces this specifically: node 'd' (40) points to 'c' (30), node 'c' (30) points to 'b' (20), node 'b' (20) points to 'a' (10), and finally node 'a' (10) points to null. He draws the final state of the linked list on the diagram, showing the arrows reversed from d -> c -> b -> a, confirming the list is now reversed with 'd' as the new head.

The video successfully demystifies recursive linked list reversal by combining code analysis with a visual trace. The instructor effectively uses the call stack diagram to show how the 'previous' pointer accumulates the reversed sequence as the recursion unwinds. By explicitly mapping node addresses (10, 20, 30, 40) to the function arguments, he clarifies how the `Current->link = previous` statement physically reverses the pointers in memory, ensuring students understand both the logical flow and the memory manipulation involved.

Loading lesson…