AVL Tree ( Self-Balancing Trees Insertion)
Jump to navigation
Jump to search
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