• AlgoMaster AIv1.0.0
Curriculum
    • What is Programming?
    • Flowcharts
    • Algorithms & Pseudocode
    • Variables & Data Types
    • Loops
    • Recursion
    • Big O Notation
    • Arrays & Strings
    • Linked Lists
    • Stack
    • Queue
    • Hashing
    • Linear Search
    • Binary Search
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
    • Binary Search Tree
    • Heaps
    • AVL TreeH
    • Trie (Prefix Tree)
    • Graph Representations
    • Breadth-First Search (BFS)
    • Depth-First Search (DFS)
    • Topological Sort
    • Dijkstra's AlgorithmH
    • Bellman-Ford AlgorithmH
    • Kruskal's AlgorithmH
    • Union-Find (Disjoint Set)
    • Greedy Algorithms
    • Dynamic Programming
    • Knapsack ProblemH
    • Longest Common SubsequenceH
    • Backtracking
    • Segment TreeH
    • Fenwick TreeH
    • Bit Manipulation
Documentation
Docs/4. Trees & Heaps

Binary Search Tree

Tree data structure where each node has at most two children, maintaining sorted order.

Topic Details

Difficulty

Medium

Complexity

Time

O(log n)

Space

O(n)

Learn More

Navigation

Previous

Quick Sort

Next

Heaps