Deletion From Link List

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-b-data-structures/linked-list/sll-basics-standard-operations/asset-deletion-from-link-list after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: 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
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture focuses on implementing deletion operations in a singly linked list using C-style pseudo-code. The instructor, Sanchit Jain, systematically breaks down two distinct scenarios: deleting a node from the very beginning of the list and deleting a node that follows a specific given location. Throughout the lesson, he utilizes on-screen code snippets and hand-drawn diagrams to visualize pointer manipulation, ensuring students understand how memory addresses are updated to maintain list integrity during deletion. The "Knowledge Gate" logo is visible in the background.

Chapters

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

    The session begins with the question displayed on screen: "Write a pseudo code for deleting a node from the starting of link-list?" The instructor presents a function `int delete(node *head)` and explains the initial safety check `if(head == null)` to handle underflow conditions. He then details the core logic: first, storing the data of the head node into a variable `Item` using `Item = head->data;`. Next, he explains the critical pointer update `head = head->next;`, which effectively removes the first node from the chain. Visually, he draws red arrows on the diagram showing the `head` pointer moving from node 'a' to node 'b', illustrating how the new head becomes the second node. The code concludes with `return item;` to return the deleted value. He also points to the `Void main()` block at the top left, showing `delete(*head)` as the function call. He draws memory addresses like 10, 20, 30, 40 under the nodes to represent physical storage locations.

  2. 2:00 – 4:50 02:00-04:50

    The lecture transitions to a new problem: "Write a pseudo code for deleting a node after a given location from the starting of link-list?" The function signature changes to `int delete(node *location)`. The instructor explains that here, we do not delete the node pointed to by `location`, but the one immediately following it. He writes `Item = location->next->data;` to capture the data of the target node. The crucial step is `Location->next = location->next->next;`, which bypasses the intermediate node. He draws red arrows on the diagram to show the link from node 'b' skipping node 'c' to point directly to node 'd'. He also briefly mentions the call `delete(*location)` in the `main` function, emphasizing that the logic relies on traversing the list to find the specific location before applying this deletion logic. The diagram labels the pointer as `loc` pointing to node 'b', and he again draws memory addresses 10, 20, 30, 40 under the nodes.

The video effectively demonstrates the mechanics of linked list deletion by contrasting head deletion with intermediate deletion. By visualizing pointer reassignment through red annotations, the instructor clarifies how nodes are physically removed from the sequence without necessarily freeing memory in the pseudo-code, focusing instead on the logical structure changes required for list traversal. This progression helps students understand that deletion is primarily about pointer manipulation rather than just memory deallocation.

Loading lesson…