Rare card
Self-balancing binary search tree
- Value
- 50 W
- Attack
- 764
- Defence
- 611
- Players
- 0
In computer science, a self-balancing binary search tree (BST) 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.
Get Self-balancing binary search tree in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack