Reversing a Link List using Loop

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-PRELIMS/data-structures/linked-list/structure-modification-pointer-logic/asset-reversing-a-link-list-using-loop after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  4. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  5. Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends
  18. Artificial Intelligence: Artificial Intelligence
  19. Unit Test - Professional Knowledge:
  20. Full Length 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

  1. 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. 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.

  3. 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.

Loading lesson…