Company Logo

Deleting a Node from Beginning of a Linked List

Lesson 50 of 63 • 1 upvotes • 8:03 mins

Anjali Luthra

This lesson explains how can we delete the first node from the linked list. The pseudocode deallocates the first node and modifies the start pointer to reflect the changes after deletion.

1

Introduction to Data Structures and Algorithms

9:09 mins

2

Introduction to 1D Arrays

13:28 mins

3

Initializing and Traversing an Array

9:09 mins

4

Application of an Array

14:45 mins

5

Deleting an element from an array

10:52 mins

6

Inserting an element in an Array

8:21 mins

7

Searching in an array

8:29 mins

8

C program for Linear Search

9:39 mins

9

Binary Search in Arrays

12:17 mins

10

Binary Search Program in C language

7:53 mins

11

Sorting an Array - Selection Sort

12:45 mins

12

Sorting an Array using BUBBLE Sort

12:04 mins

13

Sorting using Shell Sort

7:10 mins

14

Sorting an Array using Insertion Sort

12:31 mins

15

C program for Selection Sort

6:16 mins

16

Merging two arrays

12:20 mins

17

Program to merge arrays

7:27 mins

18

Two Dimensional Array - Matrices

11:33 mins

19

Transpose of a Matrix

9:31 mins

20

Adding or subtracting two matrices

7:17 mins

21

Multiplication of two matrices

12:05 mins

22

C program to multiply two matrices

10:30 mins

23

Multidimensional Arrays

8:34 mins

24

Introduction to Strings(Array of Characters)

10:39 mins

25

Calculate length of a string

9:29 mins

26

Processing Strings - Counting vowels

10:36 mins

27

Checking if string is a Palindrome or not.

8:29 mins

28

Array of Strings or 2D array of characters

9:24 mins

29

String.h library functions

10:40 mins

30

Pointers in C - Introduction

12:01 mins

31

Call by Value Vs Call By Reference/Pointers

13:37 mins

32

Examples of Call By Reference

8:40 mins

33

Arrays and Pointers relationship

9:44 mins

34

Passing arrays as arguments to functions

10:32 mins

35

Dynamic Memory Allocation

8:48 mins

36

Introduction to stacks and its applications

8:49 mins

37

Implementing Stack using arrays in C language

13:06 mins

38

Checking Parenthesis in Arithmetic expressions using Stack

12:22 mins

39

Infix to postfix conversion or reverse polish notation

14:07 mins

40

Infix to Postfix conversion containing Parenthesis

9:36 mins

41

Evaluation of Postfix expression using Stack

9:20 mins

42

Introduction to Queue and its Application

13:20 mins

43

Implementation of Queue using Arrays : Linear Queue

12:50 mins

44

Implementation of Queue using Circular Array

11:44 mins

45

Introduction to Linked List and Dynamic Memory Allocation

10:21 mins

46

Inserting a node at the end of linked list.

12:23 mins

47

Traversing a Linked List

8:28 mins

48

Adding a Node at the Beginning of a linked list.

7:46 mins

49

Inserting Node at a given position in linked list

10:04 mins

50

Deleting a Node from Beginning of a Linked List

8:03 mins

51

Deleting a Node from End of a Linked List

7:16 mins

52

Deletion from a given position in the Linked List

9:05 mins

53

Searching a Value in a Single Linked List

7:43 mins

54

Sorting a Linked List

7:55 mins

55

Merging two linked lists

11:00 mins

56

Implementing Stacks using Linked List

8:05 mins

57

Implementing Queue using Linked List

9:06 mins

58

Circular Linked List

10:24 mins

59

Insertion into a Circular Linked List

11:51 mins

60

Deletion from a Circular Linked List

9:09 mins

61

Introduction to Double Linked List

8:31 mins

62

Insertion at End in Double Linked List

8:26 mins

63

Insertion at Beginning of a Double Linked List

8:05 mins

No internet connection