Jisho

×
平衡2分探索木
Links
Wikipedia definition
1. Self-balancing binary search tree​In computer science, a self-balancing (or height-balanced) binary search tree is any node based binary search tree that automatically keeps its height (number of levels below the root) small in the face of arbitrary item insertions and deletions. These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.
Read “Self-balancing binary search tree” on English Wikipedia
Read “平衡2分探索木” on Japanese Wikipedia
Read “Self-balancing binary search tree” on DBpedia

Discussions

to talk about this word.