Search Tree Rotation: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=External= | =External= | ||
* https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/JV7KI/rotations-advanced-optional | |||
=Internal= | =Internal= | ||
* [[Binary_Search_Trees#Rotation|Binary Search Trees]] | * [[Binary_Search_Trees#Rotation|Binary Search Trees]] | ||
=Overview= | =Overview= | ||
Rotations are a set of primitives common to all binary search tree implementations, which preserve the [[Binary_Search_Trees#Binary_Search_Tree_Property|Binary Search Tree Property]]. | Rotations are a set of primitives common to all binary search tree implementations, which preserve the [[Binary_Search_Trees#Binary_Search_Tree_Property|Binary Search Tree Property]]. | ||
Revision as of 18:39, 13 October 2021
External
Internal
Overview
Rotations are a set of primitives common to all binary search tree implementations, which preserve the Binary Search Tree Property.