Make delicious recipes!

Splay trees

Splay trees are normal binary search trees with just one difference.

Whenever a node is accessed in a splay tree, that node moves up the tree to become the new root.
Such a feature helps when lot of activity is expected around a node for some time.
Since the last accessed node has become the new root, the next lookup operations would be much faster.

However, splay trees are not good if random accesses are expected.

Like us on Facebook to remain in touch
with the latest in technology and tutorials!

Got a thought to share or found a
bug in the code?
We'd love to hear from you:

Email: (Your email is not shared with anybody)

Facebook comments:

Site Owner: Sachin Goyal