Splay Trees: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
 
Line 2: Line 2:
* [[Binary_Search_Trees#AVL_Trees|Binary Search Trees]]
* [[Binary_Search_Trees#AVL_Trees|Binary Search Trees]]
=Overview=
=Overview=
Unlike [[AVL Trees|AVL trees]] and [[Red-black Trees|Red-black trees]] that are modified only on insertion and deletion, splay trees are also modified on lookups. This is why they're called self-adjusting trees.
Unlike [[AVL Trees|AVL trees]] and [[Red-black Tree|Red-black trees]] that are modified only on insertion and deletion, splay trees are also modified on lookups. This is why they're called self-adjusting trees.

Latest revision as of 04:36, 13 October 2021

Internal

Overview

Unlike AVL trees and Red-black trees that are modified only on insertion and deletion, splay trees are also modified on lookups. This is why they're called self-adjusting trees.