@inproceedings{Sitchinava2016Ics6A, title={Ics 691: Advanced Data Structures}, author={Nodari Sitchinava and Kyle Berney}, year={2016} }

- Published 2016

In the last lecture, we introduced the definition of a dynamically optimal binary search tree (BST); and conjectured that splay trees are dynamically optimal. We then looked at how we can visualize a BST using the geometric view and defined a key property of the resulting point set, an arborally satisfied set [DHI+01]. Theorem 1. A point set P ⊆ X × [m] is… CONTINUE READING

### Presentations referencing similar topics