Reversing a Link List using Loop
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture focuses on implementing an iterative algorithm to reverse a singly linked list. The instructor begins by stating the objective: "Write a pseudo code for reversing a link-list in a iteratively?" He displays a C-style code snippet on the left side of the screen. The code includes a main function calling reverse(struct node* head) and the reverse function itself. Inside the function, he initializes three pointers: Struct node *p = head;, Struct node *q = null;, and Struct node *r;. He sets up a While(p != null) loop to traverse the list. To aid understanding, he draws a linked list diagram on the right with four nodes labeled 'a', 'b', 'c', and 'd', connected sequentially to null. He explains that p acts as the current node pointer starting at 'a', while q acts as the previous node pointer starting at null. As the video progresses, the instructor details the logic inside the loop. He explains the sequence of pointer updates: r=q;, q=p;, p=p->next;, and q->next = r;. He traces the first iteration where p is at 'a'. r takes the value of q (null), q moves to 'a', p moves to 'b', and q->next (node 'a's next pointer) is set to r (null). This effectively detaches 'a' from 'b'. He continues this explanation for subsequent iterations. In the second iteration, p is at 'b', r becomes 'a', q becomes 'b', p moves to 'c', and q->next points to 'a'. He draws red arrows on the diagram to visualize these link reversals, showing how 'b' now points back to 'a'. He repeats this for nodes 'c' and 'd', demonstrating how the entire chain is reversed. He specifically highlights how r stores the previous node to maintain the reversed chain. He points out that p moves forward while q follows, effectively reversing the direction of the links. He also annotates the diagram with 'p', 'q', and 'r' labels to track their positions relative to the nodes. In the final segment, the instructor concludes the trace. After the loop terminates when p becomes null, he explains the final step head = q;. Since q now points to the last node processed (which was 'd'), assigning it to head makes 'd' the new head of the reversed list. The final diagram shows the list as d -> c -> b -> a -> null. He emphasizes that this iterative approach modifies the pointers in place without using extra space for a new list, making it an efficient O(n) time and O(1) space solution. The lecture ends with the complete reversed structure displayed on the screen, reinforcing the concept of pointer manipulation in linked data structures. The instructor ensures students understand that head must be updated to point to the new beginning of the list, which is the node that was previously the tail. He also notes that the original head 'a' now points to null, marking the end of the new list. This step-by-step visual breakdown helps clarify the complex pointer arithmetic involved in reversing a linked list. The instructor's clear explanation of the r variable's role in preserving the previous node is crucial for understanding how the chain is not broken during the reversal process.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the problem statement: "Write a pseudo code for reversing a link-list in a iteratively?" He displays the code structure on the left, defining the reverse function and initializing pointers p, q, and r. He draws a linked list diagram on the right with nodes labeled 'a', 'b', 'c', 'd' to visualize the data structure. He explains the initial state where p points to the head node 'a' and q is initialized to null.
2:00 – 5:00 02:00-05:00
The instructor details the logic inside the while loop, explaining the sequence of pointer updates: r=q, q=p, p=p->next, and q->next=r. He traces the execution step-by-step, showing how the first iteration makes node 'a' point to null, and subsequent iterations make 'b' point to 'a', 'c' to 'b', and so on. He draws red arrows on the diagram to visualize the changing links and annotates the nodes with pointer labels to track their positions.
5:00 – 6:04 05:00-06:04
The instructor concludes the trace by explaining the final step head = q. Since q now points to the last node 'd', assigning it to head makes 'd' the new head of the reversed list. The final diagram shows the list as d -> c -> b -> a -> null. He emphasizes that this iterative approach modifies pointers in place, making it an efficient O(n) time and O(1) space solution, and reinforces the concept of pointer manipulation.
The video provides a comprehensive guide to reversing a linked list iteratively. It starts with the problem statement and code setup, moves into a detailed step-by-step trace of the algorithm using a visual diagram, and concludes with the final state of the list. The instructor emphasizes the role of the three pointers (p, q, r) and the importance of updating the head pointer at the end.

