News for hackers. Stuff that matters.
Re:Treaps: A Simple Balanced Binary Tree by jbapple on Tuesday September 13, 2011 @10:50AM (#2991683)
I thought top trees were a data structure for implementing "dynamic trees" or "link-cut trees". How can they be used for implementing search trees?

Do the logarithmic update times in top trees take into account the time to locate the node to update?

There are no comments on this comment yet.