ദ്ദി •⩊• )

Home

❯

00-notes

❯

top tree

top tree

10 Apr 20261 min read

  • cs/dsa
  • moc
Properties2
upTree data structure
statusopen

A way to decompose a tree into clusters which allows efficient operations on tree—like link, cut, query path, query subtree, search for a vertex.

TODO: write more about clusters and stuff

Related

link-cut tree: a light-weight alternative of top trees for when only path operations are needed.

Applications

Self-adjusting Top Tree
Splay Top Tree
Online Dynamic Connectivity

References

Paper by Holm and Lichtenberg


Recent Notes

  • envy is rooted in self denial

    26 May 2026

    • fleeting
  • use Obsidian themes in Obsidian Gephi Lite

    22 May 2026

    • archived
  • filter by modularity class of note

    21 May 2026

    • task

See 118 more →

Graph View

  • Related
  • Applications
  • References

Backlinks

  • link-cut tree

Created with Quartz v5.0.0 © 2026

  • GitHub
  • Discord Community