AVL Tree ( Self-Balancing Trees Insertion)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(logn)$ == Space Complexity == $O({1})$ words (Each node being changed requires constant auxiliary space to make changes; can reuse space across nodes being changed) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1962 == Reference ==")
Time Complexity
$O(logn)$
Space Complexity
$O({1})$ words
(Each node being changed requires constant auxiliary space to make changes; can reuse space across nodes being changed)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1962