您要查找的是不是：
- right threaded binary tree 右线索二叉树
- This paper gives the algorithms inseting root-node and binary tree in all threaded binary tree. 给出了在全线索二叉树中插入结点和二叉树的算法,然后阐述了这种运算的特点。
- Study on Change Signification of Left and Right Tag Field in Node Structures of Threaded Binary Trees 对改变线索二叉树结点结构中左右标志域涵义的探讨
- Threaded binary tree 线索二叉树
- thread binary tree 空线二叉树
- Write a function to find the depth of a binary tree. 写个程序找到一个二叉树的深度。
- And above the level established by the binary tree traversal. 并对上面建立的二叉树按层次遍历。
- The point is that polygons are stored in a binary tree. 多边形是以点的形式在二叉树中存储的。
- The multiclass SVM methods based on binary tree are proposed. 摘要提出一种新的基于二叉树结构的支持向量(SVM)多类分类算法。
- The model is a generalization of conventional binary tree algorithm. 模型是传统的二元树形算法的推广。
- The words "Your Potential" are hidden beneath a heat-activated layer on the right thread. “Your Potential”字样隐藏在右侧线条上的热敏层下。
- Using Binary tree to save the text in sepecific file and catalogue, Delphi. 用二叉树的算法对指定目录下的文件和目录以格式化的方法保存。
- The enhanced lockset algorithm refines the data race condition by catching the end of the thread and analyzing the right thread information of various variables. 该算法通过分析线程结束情况和理解变量的线程信息，精化数据竞争检测条件。
- How would you print out the data in a binary tree, level by level, starting at the top? 你将怎样以水平打印二叉树数据,水平,在顶开始?
- For some purposes a binary tree is the best solution, but usually the simpler linked list is the obvious choice. 对于某些情况,二叉树是最佳选择,但在通常情况下,更简单的链表是显而易见的选择。
- To maintain high generalization ability, the most widespread class should be separated at the upper nodes of a binary tree. 为了获得较高的推广能力，必须让样本分布广的类处于二叉树的上层节点，才能获得更大的划分空间。
- A single feature is used to partition the set of training vectors at each nonterminal node of the binary tree. 使用分词独立结构代替状语从句或并列分句；
- Hypercuboid and hypersphere class least covers are used to be rules of constructing binary tree. 所以，该算法采用最小超立方体和最小超球体类包含作为二叉树的生成算法。
- Her clothes are always right up to the minute. 她的衣服总是式样最新的。
- The article presents the recursive and non-recursive algorithms of postorder-traversing binary tree. 摘要本文论述了后序遍歴二叉树的递归算法和非递归算法。
