Data Structures - Complete Course with Algorithms and Implementation

Data Structures - Complete Course with Algorithms and Implementation

Neso Academy via YouTube Direct link

Structures and Functions (Part 4)

27 of 144
Previous
Next

27 of 144

Structures and Functions (Part 4)

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Data Structures - Complete Course with Algorithms and Implementation

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction to Data Structures
  2. 2 Data Types vs. Abstract Data Types
  3. 3 Data Structure Definition & Advantages
  4. 4 Types of Data Structures
  5. 5 Basics of Asymptotic Analysis (Part 1)
  6. 6 Basics of Asymptotic Analysis (Part 2)
  7. 7 Basics of Asymptotic Analysis (Part 3)
  8. 8 Basics of Asymptotic Analysis (Part 4)
  9. 9 Basics of Asymptotic Analysis (Part 5)
  10. 10 Guidelines for Asymptotic Analysis (Part 1)
  11. 11 Guidelines for Asymptotic Analysis (Part 2)
  12. 12 Asymptotic Analysis (Solved Problem 1)
  13. 13 Asymptotic Analysis (Solved Problem 2)
  14. 14 Asymptotic Analysis (Solved Problem 3)
  15. 15 Understanding the Void Pointers
  16. 16 Understanding the Null Pointers
  17. 17 Understanding the Dangling Pointers
  18. 18 Understanding the Wild Pointers
  19. 19 Basics of Dynamic Memory Allocation
  20. 20 Dynamic Memory Allocation using malloc()
  21. 21 Dynamic Memory Allocation using calloc()
  22. 22 Dynamic Memory Allocation using realloc()
  23. 23 Releasing the Dynamically Allocated Memory using free()
  24. 24 Structures and Functions (Part 1)
  25. 25 Structures and Functions (Part 2)
  26. 26 Structures and Functions (Part 3)
  27. 27 Structures and Functions (Part 4)
  28. 28 Structures and Functions (Part 5)
  29. 29 Structures and Functions (Part 6)
  30. 30 Self Referential Structures
  31. 31 Introduction to Linked List
  32. 32 Array vs. Single Linked List (In Terms of Representation)
  33. 33 Creating the Node of a Single Linked List
  34. 34 Creating a Single Linked List (Part 1)
  35. 35 Creating a Single Linked List (Part 2)
  36. 36 Traversing a Single Linked List (Counting the Nodes)
  37. 37 Traversing a Single Linked List (Printing the Data)
  38. 38 Traversing the List (Linked List vs. Arrays)
  39. 39 Single Linked List (Inserting a Node at the End)
  40. 40 Insertion at the End (Linked List vs. Array) - Part 1
  41. 41 Insertion at the End (Linked List vs. Array) - Part 2
  42. 42 Single Linked List (Inserting a Node at the Beginning)
  43. 43 Inserting the Data at the Beginning of Single Linked Lists (Possible Mistake)
  44. 44 Inserting the Data at the Beginning of Single Linked List (2nd Method)
  45. 45 Inserting the Data at the Beginning (Singly Linked List vs. Array)
  46. 46 Single Linked List (Inserting a Node at a Certain Position)
  47. 47 Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 1
  48. 48 Insertion at a Certain Position (Singly Linked List vs. Arrays) - Part 2
  49. 49 Single Linked List (Deleting the First Node)
  50. 50 Single Linked List (Deleting the Last Node)
  51. 51 Single Linked List (Deleting the Last Node using Single Pointer)
  52. 52 Deletion at the End (Singly Linked List vs. Array)
  53. 53 Deletion at the Beginning (Single Linked List vs. Array)
  54. 54 Single Linked List (Deleting the Node at a Particular Position)
  55. 55 Deleting the Entire Single Linked List
  56. 56 Reverse a Single Linked List
  57. 57 Singly Linked List (Solved Problem 1)
  58. 58 Singly Linked List (Solved Problem 2)
  59. 59 Singly Linked List (Solved Problem 3)
  60. 60 Singly Linked List (Solved Problem 4)
  61. 61 Singly Linked List (Solved Problem 5)
  62. 62 Singly Linked List (Solved Problem 6)
  63. 63 Rapid Fire Quiz (Singly Linked List)
  64. 64 Introduction to Doubly Linked List
  65. 65 Doubly Linked List (Inserting a Node in an Empty List)
  66. 66 Doubly Linked List (Insertion at the Beginning)
  67. 67 Doubly Linked List (Insertion at the End)
  68. 68 Doubly Linked List (Insertion between the Nodes) - Part 1
  69. 69 Doubly Linked List (Insertion between the Nodes) - Part 2
  70. 70 Creating an Entire Doubly Linked List
  71. 71 Doubly Linked List (Deleting the First Node)
  72. 72 Doubly Linked List (Deleting the Last Node)
  73. 73 Doubly Linked List (Deleting the Intermediate Node)
  74. 74 Reversing the Doubly Linked List
  75. 75 Doubly Linked List (Solved Problem 1)
  76. 76 Doubly Linked List (Solved Problem 2)
  77. 77 Why Doubly Linked List?
  78. 78 Rapid Fire Quiz (Doubly Linked List)
  79. 79 Introduction to Circular Linked List
  80. 80 Circular Singly Linked List (Insertion at the Beginning)
  81. 81 Traversing a Circular Singly Linked List
  82. 82 Circular Singly Linked List (Insertion at the End)
  83. 83 Circular Singly Linked List (Insertion between the Nodes)
  84. 84 Creating a Circular Singly Linked List
  85. 85 Circular Singly Linked List (Deleting the First Node)
  86. 86 Circular Singly Linked List (Deleting the Last Node)
  87. 87 Circular Singly Linked List (Deleting the Intermediate Node)
  88. 88 Circular Singly Linked List (Counting the Number of Elements)
  89. 89 Circular Singly Linked List (Searching an Element)
  90. 90 Circular Doubly Linked List (Insertion at the Beginning)
  91. 91 Circular Doubly Linked List (Insertion at the End)
  92. 92 Circular Doubly Linked List (Insertion between the Nodes)
  93. 93 Circular Doubly Linked List (Deleting the First Node)
  94. 94 Circular Doubly Linked List (Deleting the Last Node)
  95. 95 Circular Doubly Linked List (Deleting the Intermediate Node)
  96. 96 Sorted Singly Linked List (Inserting a New Element)
  97. 97 Application of Linked List (Polynomial Arithmetic) - Part 1
  98. 98 Application of Linked List (Polynomial Arithmetic) - Part 2
  99. 99 Application of Linked List (Addition of Two Polynomials)
  100. 100 Application of Linked List (Multiplication of Two Polynomials)
  101. 101 Application of Linked List (Multiplication of Two Polynomials) - Improvements
  102. 102 Adding Two Numbers using Linked Lists - Part 1
  103. 103 Adding Two Numbers using Linked Lists - Part 2
  104. 104 Adding Two Numbers using Linked Lists - Part 3
  105. 105 Introduction to Stacks
  106. 106 Array Implementation of Stacks (Part 1)
  107. 107 Array Implementation of Stacks (Part 2)
  108. 108 Array Implementation of Stacks (Part 3)
  109. 109 Array Implementation of Stacks (Part 4)
  110. 110 Stacks (Important Questions) – Set 1
  111. 111 Stacks (Important Questions) – Set 2
  112. 112 Stacks (Program 1) – Part 1
  113. 113 Stacks (Program 1) – Part 2
  114. 114 Stacks (Program 1) – Part 3
  115. 115 Stacks (Program 2) – Part 1
  116. 116 Stacks (Program 2) – Part 2
  117. 117 Stacks (Program 3)
  118. 118 Linked List Implementation of Stacks (Part 1)
  119. 119 Linked List Implementation of Stacks (Part 2)
  120. 120 Linked List Implementation of Stacks (Part 3)
  121. 121 Stacks (Program 4) – Part 1
  122. 122 Stacks (Program 4) – Part 2
  123. 123 Stacks (Program 4) – Part 3
  124. 124 Stacks (Program 4) – Part 4
  125. 125 Stacks (Program 4) – Part 5
  126. 126 Stacks (Program 4) – Part 6
  127. 127 Stacks (Program 4) – Part 7
  128. 128 Stacks (Program 5)
  129. 129 Application of Stacks (Nested Brackets) - Part 1
  130. 130 Application of Stacks (Nested Brackets) - Part 2
  131. 131 Application of Stacks (Infix to Postfix) - Part 1
  132. 132 Application of Stacks (Infix to Postfix) - Part 2
  133. 133 Application of Stacks (Infix to Postfix) - Part 3
  134. 134 Application of Stacks (Infix to Postfix) - Part 4
  135. 135 Application of Stacks (Infix to Postfix) - Part 5
  136. 136 Application of Stacks (Infix to Postfix) - Part 6
  137. 137 Application of Stacks (Infix to Postfix) - Part 7
  138. 138 Application of Stacks (Infix to Postfix) - Part 8
  139. 139 Stacks (GATE Problems) - Set 1
  140. 140 Stacks (GATE Problems) - Set 2
  141. 141 Queues | Chapter-7 | Data Structures | nesoacademy.org
  142. 142 Binary Trees | Chapter-8 | Data Structures | nesoacademy.org
  143. 143 Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org
  144. 144 AVL Trees | Chapter-10 | Data Structures | nesoacademy.org

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.