Splay Tree

From Wiki :-)

Revision as of 19:03, 3 June 2018 by Savoundg (talk | contribs) (Created page with "Red-Black Tree is a self-optimizing Binary Search Tree where frequently-accessed nodes move to the root. This data structure is useful for implementing caches and garbage col...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Red-Black Tree is a self-optimizing Binary Search Tree where frequently-accessed nodes move to the root.

This data structure is useful for implementing caches and garbage collection algorithm.

Resources


https://en.wikipedia.org/wiki/Splay_tree

Retrieved from "https://wiki.georges.savound.com/index.php?title=Splay_Tree&oldid=709"