Programming & Data Structure (English) (Part 2)

   Wednesday, November 04, 2026   

Starting a new Lecture Notes Series on Programming & Data Structure

Youtube Lecture Playlist Credits 

Channel Name: IEMDaily - Video Lecture Notes (English)

So Let Us Start to This Journey of Learning 

Programming & Data Structure By Lecture Notes together!

Lecture 67: 67. Inside atoi

Lecture 68: 68. The Missing Zero

Lecture 69: 69. The Preprocessor Sneak Attack

Lecture 70: 70. C Loop Logic Decoded

Lecture 71: 71. The Illusion of Memory

Lecture 72: 72. Two-Pointer Technique Visualized | Array Manipulation and Memory Explained

Lecture 73: 73. Storage Class Arcitecture

Lecture 74: 74. Static Variable Persistence

Lecture 75: 75. Static Recursion Visualized

Lecture 76: 76. C Memory Architecture

Lecture 77: 77. C Dynamic Memory Management

Lecture 78: 78. C Structure Architecture

Lecture 79: 79. Visualizing C Pointers

Lecture 80: 80. Self Referential Structures

Lecture 81: 81. Dynamic Memory Mastery

Lecture 82: 82. Printf Deconstructed

Lecture 83: 83. Mastering C Input

Lecture 84: 84. The Bitwise Scanner

Lecture 85: 85. C File Handling

Lecture 86: 86. C File Navigation

Lecture 87: 87. Fluid String IO

Lecture 88: 88. C Data Streams

Lecture 89: 89. The Journey of a Byte

Lecture 90: 90. Dynamic C Memory

Lecture 91: 91. C Line Counting

Lecture 92: 92. Visualizing C File I O

Lecture 93: 93. Tracing Recursion Step by Step | Recursion Tree and Call Stack Explained

Lecture 94: 94. Visualizing Link List

Lecture 95: 95. Linked List Traversal

Lecture 96: 96. Visual Node Insertion

Lecture 97: 97. Linked List Deletion

Lecture 98: 98. SLL Pairwise Reordering

Lecture 99: 99. Tail to Head

Lecture 100: 100. Unwinding Recursion

Lecture 101: 101. Iterative List Reversal

Lecture 102: 102. Recursive List Reversal

Lecture 103: 103. Linked List Hacks

Lecture 104: 104. Circular Sentinel Architecture

Lecture 105: 105. Recursive Logic Decoded

Lecture 106: 106. Doubly Linked List Mastery

Lecture 107: 107. Understanding Stacks

Lecture 108: 108. Array Stack Mechanics

Lecture 109: 109. Dynamic Linked Stacks

Lecture 110: 110. Decoding Circular Queues

Lecture 111: 111. Single Pointer Circular Queues

Lecture 112: 112. Stack Permutation

Lecture 113: 113. Priority Queues Stacks

Lecture 114: 114. Average Stack Lifetime

Lecture 115: 115. Two Stack Queues

Lecture 116: 116. Stack Queue Logic

Lecture 117: 117. Infix to Postfix

Lecture 118: 118. Postfix Engine

Lecture 119: 119. Binary Tree Traversals

Lecture 120: 120. Visualizing Trersals

Lecture 121: 121. The Recursion Checklist

Lecture 122: 122. Triple Order Traversal

Lecture 123: 123. Indirect Tree Recurtion

Lecture 124: 124. Binary Tree Combinatorics

Lecture 125: 125. Decoding Tree Uniqueness

Lecture 126: 126. Binary Tree Recx Reconstruction

Lecture 127: 127. Recursive Node Counting

Lecture 128: 128. Visualizing Tree Recursion

Lecture 129: 129. The Full Node Algorithm

Lecture 130: 130. Visualizing Tree_Height

Lecture 131: 131. Binary Search Tree_Logic

Lecture 132: 132. Decoding the Binary_Search_Tree