balanced binary search tree
基本解釋
- [計算機科學(xué)技術(shù)]平衡二元搜尋樹
- [電子、通信與自動控制技術(shù)]平衡二元搜尋樹
英漢例句
- Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和刪除操作的開銷是很大的,只主要是因為對半查找樹的平衡性所決定的。
blog.sina.com.cn - The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.
建立高度平衡的二叉搜索樹是為了提高二叉搜索樹的效率,減少樹的平均搜索長度。
雙語例句
專業(yè)釋義
- 平衡二元搜尋樹
- 平衡二元搜尋樹