Which is a self-adjusting or self-balancing binary search tree?
Answers
Answered by
2
In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.
Similar questions