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 loga

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?