binary search tree

基本解釋

• 二元搜索樹(shù)
• 二叉查找樹(shù)

英漢例句

雙語(yǔ)例句

• By limiting the number of children to 2, we can write efficient programs for inserting data, deleting data, and searching for data in a binary tree.
  通過(guò)限制子結(jié)點(diǎn)，我們可以在二叉樹(shù)中快速地插入，刪除，查找數(shù)據(jù)。
• Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
  也許同樣重要的是基本的算法，如二進(jìn)制搜索，圖形搜索算法，排序算法，并基于樹(shù)的極小搜索。
  treasure.1x1y.com.cn
• Based on SPKI technology, proposing multicast distributed access control system: MDAC, as wall as, proposing a delegation certificate path(DCP) searching algorithm based on binary tree.
  基于SPKI技術(shù)提出了組播分布式訪(fǎng)問(wèn)控制系統(tǒng)MDAC，并提出了基于二叉授權(quán)委托樹(shù)的委托證書(shū)路徑（DCP） 查找算法。

• binary search tree更多例句

詞組短語(yǔ)

短語(yǔ)

• binary -tree searching of backtracking 返回式二進(jìn)制樹(shù)形搜索
• searching binary -tree 搜索二叉樹(shù)

• binary search tree更多詞組