algorithmik.

LearnRead
K
About
Structure of This Guide
Choosing a Language
Important Problems
Blind 75
LeetCode Problem Lists
Submit A Problem Set
User-Submitted
Arrays
Strings
Stacks
Queues
Graphs
Sorting
Binary Search
Two Pointers
Greedy
Sliding Window
Depth-First Search
Breadth-First Search
Backtracking
Dynamic Programming
Bit Manipulation
Algorithmic Complexity
Pointers
Recursion
Complexity of Various Algorithms
Identifying Patterns
Learning Roadmap
Algorithms All in One
  1. Guide
  2. Data Structures
  3. Trees

Trees

Understanding trees as a data structure.

Binary Tree

An easy-to-understand explanation of the Binary Tree data structure.

Binary Search Tree

A detailed yet simple explanation of the Binary Search Tree (BST) data structure.

Trie

A detailed explanation of the Trie data structure with examples and use cases.

Segment Tree

Understanding Segment Trees and their importance in range queries.

Previous
Max Heap
Next
Binary Tree

    Built with ❤️ by Mehul.

    SponsorBuy Me A Coffee