0 devlogs
0s
A self-balancing binary search tree that has a maximum height of log₃/₂_{n} and maintains balance through finding the first ancestor that violates the rule of:
left subtree size ≤ α × total size
or
right subtree size ≤ α × total size