Search Tree Rotation

From NovaOrdis Knowledge Base

Revision as of 18:39, 13 October 2021 by Ovidiu (talk | contribs) (→‎External)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

External

https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/JV7KI/rotations-advanced-optional

Internal

Binary Search Trees

Overview

Rotations are a set of primitives common to all binary search tree implementations, which preserve the Binary Search Tree Property.

Retrieved from "https://kb.novaordis.com/index.php?title=Search_Tree_Rotation&oldid=83711"