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
- About Course: About the Course
- 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)
- 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
- 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
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- 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
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- 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
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length 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
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.

