您要查找的是不是：
- extended binary tree 扩充的二叉树,扩展的二叉树
- One is the Extended Binary Coded Decimal Interchange Code(EBCDIC). BCD方案：用BCD码，可以将十进制数的每一位转换成相等的二进制数，而不是将整个十进制数转换成纯二进制数的形式。
- One is the Extended Binary Coded Decimal Interchange Code（EBCDIC）. 还有另外两种普遍使用的8位编码。
- 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)多类分类算法。
- Extended Binary Phase Shift Keying (EBPSK) is a kind of bandwidth efficient modulations. 摘要扩展的二元相移键控是一种高效调制技术。
- Extended Binary Coded Decimal Interchange Code(EBCDIC) A character set coding scheme that represens 256 standard characters. 扩展二进制编码 十进制交换代码 一种字符集编码方案,代表256个标准字符。
- The model is a generalization of conventional binary tree algorithm. 模型是传统的二元树形算法的推广。
- Using Binary tree to save the text in sepecific file and catalogue, Delphi. 用二叉树的算法对指定目录下的文件和目录以格式化的方法保存。
- One is the Extended Binary Coded Decimal Interchange Code(EBCDIC).This code is used in IBM mainframe models and in similar machines produced by other manufactures. 一种是扩充的二-十进制交换码(EBCDIC)，该编码用于IBM大型计算机及其他厂家生产的类似机器中；
- One of several unique characters found in the Mag Card Code (D-S3-3220-006)and Extended Binary Coded Decimal Interchange Code (C-S3-3220-002) providing a means to format text for business correspondence and communications. 磁卡码(D-S 3-3220-006)的扩展的二进制编码的十进制交换码(C-S 3-3220-002)中几个特殊字符之一，提供用于商务信件和通信的文本格式化方法。
- 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. 所以，该算法采用最小超立方体和最小超球体类包含作为二叉树的生成算法。
- EBDIC Extended Binary Decimal Interchange Code 扩展的二进制十进制交换码
- The article presents the recursive and non-recursive algorithms of postorder-traversing binary tree. 摘要本文论述了后序遍歴二叉树的递归算法和非递归算法。
