Thursday, August 13, 2009 [Tweets] [Favorites]

Maintaining a Layout

Allan Odgaard on finger trees:

The only nodes which need updating are those on the path from the root down to the inserted node, i.e. we never update more nodes than the height of the tree which is log(n) (assuming our binary search tree is self-balancing)…

Comments

Stay up-to-date by subscribing to the Comments RSS Feed for this post.

Leave a Comment