5 docs tagged with "BST"

Exploring the differences, performance trade-offs, and use cases of Binary Search Trees (BST) and Hash Tables.

In this blog post, we'll explore binary search trees (BSTs), a special type of binary tree that allows for efficient searching, insertion, and deletion of elements.

A complete guide to Red-Black Trees -- self-balancing binary search trees with color-based balancing, properties, rotations, and implementations.

Determine whether the subtree rooted at each node is a Binary Search Tree (BST). Find the size of the largest BST.

A comprehensive guide to Treap - a randomized BST that combines properties of Binary Search Trees and heaps for self-balancing.