Simple Snippets Courses

Binary Tree Traversal Techniques - DFS vs BFS - DFS Preorder vs Inorder vs Postorder

Comprehensive guide to binary tree traversal techniques, covering DFS (pre-order, in-order, post-order) and BFS with diagrams and code examples. Ideal for understanding tree data structure algorithms.

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

Binary Search Tree - Insertion Operation - Insert New Node Operation

Learn to insert nodes in a Binary Search Tree with step-by-step explanations, pseudocode walkthrough, and C++ implementation. Gain practical skills in BST operations and data structure manipulation.

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

Binary Search Tree - Implementation with Full Code - Part 1 - Setup

Comprehensive tutorial on implementing Binary Search Trees in C++, covering theory, class diagrams, and initial code setup for BST implementation.

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

Simple Triangle-Half Pyramid - Pattern Printing Programs

Learn to code triangle patterns and half pyramids in C++. Step-by-step explanations, dry runs, and practical implementations for different pattern variations.

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

Simple Triangle-Half Pyramid - Pattern Printing Programs With C++ Code

Learn to code triangle patterns and half pyramids in C++. Step-by-step dry runs, diagrams, and program implementations for two pattern variations. Ideal for beginners in pattern printing.

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

Binary Search Tree Data Structure - How BST Has O(log N) Time Complexity for Searching? - DSA

Comprehensive exploration of Binary Search Trees, covering structure, time complexity analysis, and comparisons with linear data types. Ideal for understanding BST efficiency.

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

What Is Hashing - Why Do We Need It - What Is a Hash Function - Example - Array vs Hash Table

Explore hashing, hash functions, and hash tables. Learn their importance and benefits over arrays through practical examples and comparisons.

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

Closed Hashing - Linear Probing, Quadratic Probing & Double Hashing - Collision Control

Explore closed hashing techniques: linear probing, quadratic probing, and double hashing. Learn collision control strategies for efficient hash table implementation and data structure optimization.

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

Deleting Key in B-Tree Data Structure - Deletion Process with Example

Comprehensive tutorial on deleting keys in B-Tree data structures, covering the deletion process with step-by-step examples and diagrams for better understanding.

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

M-way Search Tree Data Structure - Insertion and Deletion Operations

Learn insertion and deletion operations in M-way search trees through step-by-step examples. Gain practical understanding of this advanced data structure for efficient searching and organization.

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

M-way Trees and M-way Search Trees - Comparison with Binary Search Trees

Explore M-way trees and M-way search data structures, comparing them to binary search trees. Learn their structure, benefits, and applications in data organization and retrieval.

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

Graph Data Structure - Delete Edge Operation Using Adjacency List - Part 6

Learn to implement the delete edge operation in graph data structures using C++, focusing on adjacency list representation and practical coding techniques.

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

Graph Data Structure - Update Edge Operation Using Adjacency List - Part 5

Learn to update edge weights in a graph using C++ with adjacency list implementation. Covers pseudocode, working principles, and practical coding for efficient graph manipulation.

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

Graph DS - Print Graph Operation Using Adjacency List Implementation - Part 4

Learn to implement the print graph operation for adjacency list representation in C++, covering traversal techniques and efficient data structure usage.

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

Graph Data Structures - Add Edge Operation Using Adjacency List Implementation - Part 3

Learn to implement the Add Edge operation in Graph Data Structures using C++. This tutorial covers pseudocode explanation and practical coding for efficient graph manipulation using adjacency lists.

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