Insertion in Link List
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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 Security
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
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
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: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.

