Directed Graph — Data Structures
🔹 What Is a Directed Graph? A directed graph is made up of: A directed edge has a start point …
Data Structures
Hashing — Searching
🌟 What Is Hashing? Hashing is a method of finding data super fast.Instead of searching through the whole list, we …
B Tree and B + Tree
🌳 1. What is a B Tree? A B Tree is a self-balancing search tree where each node can hold …
General Search Trees — Searching
🌿 General Search Trees When we hear the word “searching”, we often think of looking for something — maybe finding …
Balanced Trees – AVL Trees
🌟 Balanced Trees – AVL Trees Let’s start with a simple question:What happens if a Binary Search Tree (BST) grows …
Optimum Search Trees — Searching
🌟 Searching (Optimum Search Trees) Imagine you have a small library and you often look up books by their titles.Some …
Tree Searching — Searching
🌳 Searching (Tree Searching) Let’s start with a simple question:If you wanted to find a person’s name in a family …
Interpolation Search — Searching
🌟(Interpolation Search) Imagine you have a telephone directory sorted alphabetically — names starting from A at the top and Z …
Binary Search — Searching
💡 What Is Binary Search? Binary Search is a fast searching technique that works on sorted data.Instead of checking every …
Radix Sort — Sorting
🌱 What Is Radix Sort? Radix Sort is a non-comparative sorting algorithm — meaning it doesn’t compare numbers directly.Instead, it …