MA/CSSE 473 Days 31-32. Optimal linked lists Optimal BSTs. MA/CSSE 473 Days 31-32. Student Questions? Optimal Linked Lists Expected Lookup time in a Binary Tree Optimal Binary Tree (intro Day 31, finish Day 32). Warmup : Optimal linked list order.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
MA/CSSE 473 Days 31-32
Optimal linked lists
See Levitin: page 183 
one more than
When n=20, c(n) is almost 1010
Wikipedia Catalan article has five different proofs of
Note: y0, …, yn are the external nodes of the tree
How to construct the optimal tree?
Analysis of the algorithm?