180 likes | 207 Vues
2007-10-5. 2. Roadmap. Homework 2 Problem DefinitionHow to tackleHash table: why and howBST: getcost()Optimize: how to make it recursiveTop-down VS bottom-up in DPDP recipe. 2007-10-5. 3. Optimal Binary Search Tree. ProblemGiven sequence K = k1 < k2 < < kn of n sorted keys, with a search
E N D