Skip to main content

Optimal BST

Learn Optimal BST (Dynamic Programming, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Building a BST That Minimizes Expected Search Cost Given keys with KNOWN search frequencies, arrange them into a BST minimizing total weighted search cost (frequency × depth, summed over all keys) - keys searched more often should sit CLOSER to the root. Interval DP: try every key as the ROOT of a range, recursively optimizing the left and right subtrees.

More lessons in Dynamic Programming