单词 | balanced-tree |
释义 | balanced-tree [`bal·ǝnst `trē] COMPUTER SCIENCE A system of indexes that keeps track of stored data, and in which data keys are stored in a hierarchy that is continually modified in order to minimize access times. Abbreviated B- tree. |
随便看 |
|
科学参考收录了103327条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。