Optimal Binary Search Tree Minimize the time cost for binary-search. Dummy keys used to indicate those without an actual values in the tree. Tables used: Weight (search cost) at a certain key (node) Root picked for each node. Expected search cost