脚被夹在树叉中他唧哩呱啦的惊叫唤。
我们还看到一只树獭花了半个小时，从一树叉上爬到另一枝上。
We also watched a sloth take about a half hour to move from one branch to the other.
尽管球相对于地面来说是移动了，但相对于树叉来说没有移动。
Although the ball has moved relative to the ground, it has not moved relative to the fork.
球不能被认定是移动了，因为相对于它所停的树叉来说它并没有移动。
The ball is deemed not to have moved since it did not move in relation to the fork of the tree in which it was lodged.
在椎间孔外区，后支主干及其分支与出口腰神经前支的关系密切，血管呈“树叉”状从外侧将神经包绕。
In the out space of the foramens, the posterior branches located laterally to the exiting nerve and formed an "arbor" around it.
以八叉剖分来建立一棵顶点树，用以表示整个网格模型的数据结构。
A vertex tree is built to represent the data structure of the models by octonary subdivision.
现在，这个决策树，如果我走左边的分支，这是一棵二叉树。
Now, the decision tree, if I branch left, it's a binary tree.
树底下画了一堆燃烧着的火，三只野兔抬着一个穿在烤叉上的猎人在火上烘烤，树后面，另一堆火上挂一口热气腾腾的锅，锅里露出一个狗头。
At the foot of this tree a fire was burning, over which three hares were roasting a huntsman on a spit, and behind him, on another fire, hung a steaming pot, whence emerged the head of a dog.
增强的JFS2在执行索引节点搜索时使用二叉树表示形式，与JFS使用的线性方法相比，这种方法要好得多。
Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
红黑树是一个自平衡的二叉查找树。
要创建二叉树，可以简单的创建一个CSimpleBinaryTree对象并初始化。
To create the Binary Tree simply create a CSimpleBinaryTree object and initialise it.
我不会详细介绍二叉树理论的详细细节，因为这些东西，Per Nilsson已经在他的“二叉树”中讨论过了，你可以在如下地址here找到详细的细节。
I won't go into the gory details of Binary Tree Theory as this has already been discussed by Per Nilsson in his "Balanced Binary Tree" submission found here.
描述二叉树(binarytree)的节点有一个数据值、一个左指针和一个右指针；不过，很多数据体要求树不只有一个左分支和一个右分支。
Binary trees are represented by nodes that have a data value and a left and right pointer; however, there are many data structures that require trees with more than just a left and right branch.
正如我所说，二叉树排序是一种非常有效且快速的方法。
As I said, binary trees are a very efficient and fast way of sorting.
关于二叉树的相关知识和算法，适合学习数据结构和算法的朋友，欢迎下载！
On the tree of knowledge and algorithms for learning data structures and algorithms friends are welcome to download!
二叉树的操作和使用。
这是一个已经通过调试成功的二叉树算法程序，希望对大家有帮助。
This is a success has been through the debugging process tree algorithm, and they hope to help everyone.
使用这种四叉树，我们可以在场景的不同的地方用不同的方法压缩高度数据。
Using this quadtree, we can encode height data at different resolutions in different regions in the terrain.
其次，将BOM的各种数据结构进行分析，选择了二叉树表示型的数据结构来存储bom，同时利用二叉树型的BOM实现从核心企业到节点企业的任务分解。
Next, it analyzed various kinds of data structure of BOM and chose binary tree as the data structure to save BOM, and realize duty decomposition from the core enterprise to the node enterprise.
实验结果表明，基于SLM生成的二叉树能够较好地为语音停顿的预测做出贡献。
The results of experiments show that the bintree based on SLM can make contribution to speech pauses' prediction effectively.
二叉树方法就是比较常用的数值方法之一。
The binomial tree is one of the numerical methods in common use.
二叉树是计算机科学中最基本的也是最重要的树型数据结构。
Binary trees are the most fundamental and important data structures used in computer science.
采用四叉树的层次数据结构来表示物体运动。
The object motion was represented using hierarchical data structure of quad tree.
一个八叉树实际上就是一个数据结构。
让你清晰的了解到二叉树的特点。
You clearly understand the characteristics of a binary tree.
提出了一种基于自适应四叉树分形编码的数字水印技术。
This article introduces a digital watermarking technology based on adaptive quadtree fractal coding.
本文将对满二叉树的结构进行深入分析，采用深度遍历与广度遍历两种途径给出递推关系式。
This paper goes deeply into such tree's structure using both depth search and breadth search, and gives recursive relationship separately.
你可以应用八叉树到很多别的地方。
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
在该模型中，采用了一种新的与视点相依赖的动态误差度量准则，对四叉树地形模型的拼接缝消除算法进行了改进。
In this model, a new rule for evaluating view dependent dynamic error is adopted and the method of repairing the cracks intrinsically caused by quadtree data structure is also improved.
应用推荐