Splay Trees Explained and Implemented in Java with Examples | Splaying Nodes | Geekific

preview_player
Показать описание

In the previous videos of this series we started by implementing your classic Binary Search Tree. Then in the AVL and Red-Black trees videos, we enhanced this implementation to become a self-balancing tree. In this video we combine the properties of a binary search tree and the rotations used to self-balance a tree into a new implementation called: Splay Trees.

Timestamps:
00:00 Introduction
00:31 What are Splay Trees?
02:19 Splaying Situations
05:24 Splay Trees Implementation
08:44 Implementing the "find" Operation
12:20 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:

#Geekific #Heaps #DataStructures #MaximumHeap #MinimumHeap #Java
Рекомендации по теме
Комментарии
Автор

Thank you for this video. It's helping me a lot!
I just wanted to let you know I think there's a mistake at about timestamp 3.49. The rotated tree shown on the right has different data than the one shown on the left, unless I misunderstood something.

galantelorenzo