Tag
#binary-search-tree
3 articles tagged binary-search-tree.
DSAintermediate
Balanced Search Trees: How AVL and Red-Black Trees Stay Fast
Balanced search trees explained: AVL and red-black, the self-balancing binary search tree data structure that guarantees O(log n). Rotations, time complexity, and interview questions.
17 min read
DSAintermediate
Binary Search Trees: One Rule for Fast Search, Insert, and Delete
A diagram-first guide to the binary search tree data structure and its algorithms: search, insert, in-order sort, and the three delete cases, with time complexity and interview questions.
14 min read
DSAbeginner
Binary Trees Explained: Traversals, Height, and Why In-Order Is Sorted
A diagram-first guide to the binary tree data structure: nodes, terminology, the three DFS traversals plus level-order BFS, height and time complexity, and a complete interview-ready implementation.
15 min read