Reversing a Link List using Recursion

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/data-structure-and-algorithms/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. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  13. Paper 2 | Compiler Design: 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…