Splay tree

Splay tree is used for caches and garbage collection. It relieves your memory devices.

This is upside down. The root will be the node.

The worst-case height is O(n), but the average is O(log n).

This is Zig-Zag step.

rank(n)=log n

ΔΦ=0

Θf=Θ'i

You search all nodes to reorganize it like heap sort.
Your caches are convenient, but it is complicated. O(1) is faster. Is is ancient to click the link?