Insertion in Link List

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/linked-list/sll-basics-standard-operations/asset-insertion-in-link-list after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture focuses on implementing linked list insertion operations in C-style pseudocode. The instructor begins by addressing the task of inserting a node at the beginning of a list, detailing the necessary structure definition and function logic. He then transitions to inserting a node after a specific location, highlighting the critical order of pointer updates to prevent data loss.

Chapters

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

    The session addresses "Write a C-style pseudocode for inserting a node with a key in the starting of link-list?". The instructor displays the node structure definition: `typedef struct node { int data; struct node *next; };`. The instructor defines the function `Void Insert(Node** head, int key)`. The core logic involves three steps: first, creating a new node using `node* new = Create_new_node(key);`. Second, linking the new node to the current head with `new -> next = *head;`. Third, updating the head pointer itself using the double pointer syntax `*head = new;`. A diagram illustrates the new node becoming the new head, pointing to the previous first node. He also details the helper function `CreateNewNode(int key)`, which uses `malloc` to allocate memory, assigns the key to `data`, and initializes `next` to `NULL`. This allows the function to modify the original head pointer in the calling scope.

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

    Next, the topic addresses "Write a C-style pseudocode for inserting a node with a key after a location in a link-list?". The function signature changes to `Void Insert(Node* Loc, int key)`. A safety check `if(Loc == null) { return; }` ensures the location pointer is valid. The insertion logic follows: create the new node `node* new = Create_new_node(key);`. Crucially, he explains the order of operations. First, the new node's next pointer must point to the node currently following Loc: `new -> next = Loc -> next;`. Only then is Loc's next pointer updated to point to the new node: `Loc -> next = new;`. A diagram shows the new node inserted between `Loc` and the subsequent node. The instructor emphasizes that reversing this order would lose the reference to the rest of the list. The function is reviewed, confirming it allocates memory and initializes fields.

The lesson systematically builds understanding of pointer manipulation in linked lists. By contrasting insertion at the head (which requires a double pointer) with insertion after a node (which requires careful sequencing of pointer assignments), the instructor provides a clear framework for modifying list structures without losing data. The visual progression from code to diagram reinforces the abstract pointer logic.

Loading lesson…