De-amortizing Binary Search Trees — mentioned by jbapple

Sun, 18 Aug 2019 18:56:03 GMT

> Weight is a weaker condition, since you can construct a polynomial weight sequence that results in linear height. I'd like to hear more. The varieties of weight-balanced trees I'm aware of all have logarithmic height. > In general, height is the easiest thing to restrict, but doing so restricts dynamic performance optimizations - you can't use splay trees, for instance Good point. BTW, you might be interested in Bose et al.'s "De-amortizing Binary Search Trees" <https://arxiv.org/pdf/1111.1665.pdf>, shows how to keep height logarithmic with "essentially any Binary Search Tree" (their…

Paper and discussion history. A mention is not an endorsement.

De-amortizing Binary Search Trees · HackerPapers discussions

De-amortizing Binary Search Trees — mentioned by jbapple