Binary Search on Answer
An optimization technique that searches a range of possible answers using a monotonic feasibility test.
Heapify
The process of restoring the heap property at a node or transforming a collection into a heap.
In-order Traversal
A depth-first tree traversal that visits the left subtree, the current node, and then the right subtree.
IVF (Inverted File Index)
An approximate nearest-neighbor index that partitions vectors into clusters and searches only the most promising partitions.
K-Means Clustering
An unsupervised learning algorithm that partitions observations into groups represented by their centroids.
Level-order Traversal
A breadth-first tree traversal that visits nodes one level at a time from the root downward.
Post-order Traversal
A depth-first tree traversal that visits both subtrees before the current node.
Trie
A tree-shaped data structure for storing strings and answering prefix-based queries efficiently.
Prefix Sum
A preprocessing technique for answering range-sum and cumulative-frequency queries efficiently.
Pre-order Traversal
A depth-first tree traversal that visits the current node before its left and right subtrees.
Two Pointers
A traversal technique that uses two indices to efficiently process arrays, strings, or linked structures.