binary tree
基本解釋
- [計(jì)] 二叉樹(shù)；二進(jìn)制樹(shù)形網(wǎng)絡(luò)
英漢例句
- Now, the decision tree, if I branch left, it's a binary tree.
現(xiàn)在，這個(gè)決策樹(shù)，如果我走左邊的分支，這是一棵二叉樹(shù)。 - Because the red-black tree is a binary tree, the time complexities of lookup operations are logarithmic.
由於紅黑樹(shù)是二叉樹(shù)，查找操作的時(shí)間複襍度爲(wèi)對(duì)數(shù)。 - Enhanced JFS2 uses a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
增強(qiáng)的 JFS2 在執(zhí)行索引節(jié)點(diǎn)搜索時(shí)使用二叉樹(shù)表示形式，與 JFS 使用的線(xiàn)性方法相比，這種方法要好得多。 - Now, the decision tree, if I branch left, it's a binary tree.
現(xiàn)在，這個(gè)決策樹(shù)，如果我走左邊的分支，這是一棵二叉樹(shù)。
麻省理工公開(kāi)課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
雙語(yǔ)例句
原聲例句
詞組短語(yǔ)
- Balanced Binary Search Trees 平衡二叉搜索樹(shù)
- Binary Sort trees 或二叉排序樹(shù)
- Binary Triangle Trees 二元三角樹(shù)
- Optimal Binary Search Trees 最優(yōu)二叉查找樹(shù)
- Unique Binary Search Trees 唯一二叉搜索樹(shù)
短語(yǔ)
專(zhuān)業(yè)釋義
- 二叉樹(shù)
- 二分樹(shù)