Simple Snippets Courses

Adjacency List in Graph Data Structure - Implementation and Concepts

Learn how an adjacency list represents a graph, with array-based and linked-list implementations.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

Adjacency Matrix in Graph Data Structure - Graph Implementation

Learn how a Boolean matrix represents connections between graph vertices, including how the representation works and its time and space complexity.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

Heapsort Sorting Algorithm - Min Heap Implementation with Pseudocode

A worked min-heap heapsort dry run connects the algorithm’s steps to pseudocode and a complete C++ implementation.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Delete Key Operation in Heap Data Structure - Step by Step Working with Diagram

Trace heap key deletion through a diagram and pseudocode dry run, then implement the operation in a C++ min heap.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

Insertion in Heap Data Structure - Step by Step Working with Diagram

A diagram-led walkthrough traces min-heap insertion from a pseudocode dry run to a C++ implementation.

• YouTube
• 27 minutes
• Self-Paced
• Free Video

Heap Data Structure Implementation Using Arrays - Part 1: Min Heap

Learn how a heap’s complete binary tree structure maps to an array, and set up a C++ program to implement its operations.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Hollow Diamond Pattern Printing With C++ Code

A dry run breaks down the spacing and triangles that form a hollow diamond, then shows how to print the pattern in C++.

• YouTube
• 38 minutes
• Self-Paced
• Free Video

What Is Balancing a Binary Tree and Why Do We Need Balancing

Learn what it means to balance a binary tree and why keeping subtree heights close matters.

• YouTube
• 26 minutes
• Self-Paced
• Free Video

Breadth First Search (BFS) and Level Order Tree Traversal in Binary Trees - C++ Implementation

Explains binary-tree breadth-first traversal through level-order reasoning, pseudocode, and a C++ implementation.

• YouTube
• 50 minutes
• Self-Paced
• Free Video

Search Operation in Binary Search Tree - Iterative Technique with C++ Code

A step-by-step dry run and C++ implementation of iterative search in a binary search tree.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

Post-Order Tree Traversal Technique - DFS Tree Traversal with Diagram and C++ Code

A diagram-led walkthrough of postorder traversal, from recursive pseudocode dry runs to a C++ implementation.

• YouTube
• 37 minutes
• Self-Paced
• Free Video

InOrder Tree Traversal Technique - Working with Diagrams and C++ Code

Learn in-order tree traversal by following its left-node-right sequence from diagram and pseudocode to a C++ implementation.

• YouTube
• 35 minutes
• Self-Paced
• Free Video

Preorder Tree Traversal Technique - DFS Tree Traversal Technique

Learn preorder traversal by visiting each node before recursively traversing its left and right subtrees, then see the method implemented in C++.

• YouTube
• 35 minutes
• Self-Paced
• Free Video

Introduction to Binary Tree Data Structure - Properties, Variants and Modes of Implementation

Learn how binary trees are defined, how complete and balanced variants differ, and how to implement this structure.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

Introduction to Tree Data Structure - Important Terms and Properties

Introduces tree data structures through a real-world hierarchy analogy, comparing their logical and implementation views and explaining key terms and properties.

• YouTube
• 32 minutes
• Self-Paced
• Free Video