您要查找的是不是：
- Write a function to find the depth of a binary tree. 寫(xiě)個(gè)程序找到一個(gè)二叉樹(shù)的深度。
- And above the level established by the binary tree traversal. 并對上面建立的二叉樹(shù)按層次遍歷。
- The point is that polygons are stored in a binary tree. 多邊形是以點(diǎn)的形式在二叉樹(shù)中存儲的。
- The multiclass SVM methods based on binary tree are proposed. 摘要提出一種新的基于二叉樹(shù)結構的支持向量(SVM)多類(lèi)分類(lèi)算法。
- The model is a generalization of conventional binary tree algorithm. 模型是傳統的二元樹(shù)形算法的推廣。
- Using Binary tree to save the text in sepecific file and catalogue, Delphi. 用二叉樹(shù)的算法對指定目錄下的文件和目錄以格式化的方法保存。
- How would you print out the data in a binary tree, level by level, starting at the top? 你將怎樣以水平打印二叉樹(shù)數據,水平,在頂開(kāi)始?
- For some purposes a binary tree is the best solution, but usually the simpler linked list is the obvious choice. 對于某些情況,二叉樹(shù)是最佳選擇,但在通常情況下,更簡(jiǎn)單的鏈表是顯而易見(jiàn)的選擇。
- To maintain high generalization ability, the most widespread class should be separated at the upper nodes of a binary tree. 為了獲得較高的推廣能力，必須讓樣本分布廣的類(lèi)處于二叉樹(shù)的上層節點(diǎn)，才能獲得更大的劃分空間。
- A single feature is used to partition the set of training vectors at each nonterminal node of the binary tree. 使用分詞獨立結構代替狀語(yǔ)從句或并列分句；
- Hypercuboid and hypersphere class least covers are used to be rules of constructing binary tree. 所以，該算法采用最小超立方體和最小超球體類(lèi)包含作為二叉樹(shù)的生成算法。
- The article presents the recursive and non-recursive algorithms of postorder-traversing binary tree. 摘要本文論述了后序遍歴二叉樹(shù)的遞歸算法和非遞歸算法。
- The binary tree consists of a single-root node and a set of terminal and nonterminal nodes. 介詞十動(dòng)名詞短語(yǔ)代替定語(yǔ)從句或狀語(yǔ)從句。
- Then identity-based binary tree encryption scheme is constructed.As a result, a concrete IBE-NIKU is given. 基于已有的二叉樹(shù)加密構造了基于身份的二叉樹(shù)加密方案及非交互式密鑰更新的基于身份加密方案；
- An algorithm that traverses a general binary tree will have complexity O( 2 N ). 一個(gè)算法，遍歷一般二叉樹(shù)將復雜性為O(2 N)段。
- This paper gives the algorithms inseting root-node and binary tree in all threaded binary tree. 給出了在全線(xiàn)索二叉樹(shù)中插入結點(diǎn)和二叉樹(shù)的算法,然后闡述了這種運算的特點(diǎn)。
- This paper analyzed the relation between the complete binary tree nodes and the leaves number by two ways. 該文從兩個(gè)角度分析了完全二叉樹(shù)的總結點(diǎn)數與葉結點(diǎn)數之間的關(guān)系。
- If a binary tree becomes degenerate, we run into the same efficiency problems as we did with the singly linked list. 如果二叉樹(shù)變得很不平衡，我們將會(huì )碰到同樣的效率問(wèn)題如同在持久化單向鏈表是一樣。
- Binary Tree Class - A binary tree is a data structure with nodes that include no more than two linked nodes. They are often used for sorting data. 二叉樹(shù)是一個(gè)具有節點(diǎn)的數據結構,其每個(gè)節點(diǎn)最多包含兩個(gè)子節點(diǎn)。它們經(jīng)常用來(lái)排序數據。
- Visual SEEK system developed by Columbia university, this system construct index with binary tree algorithm and retrieval based on spatial information. 哥倫比亞大學(xué)開(kāi)發(fā)的VisualSeek系統，采用了二進(jìn)樹(shù)算法構造索引，支持空間位置關(guān)系的查詢(xún)。
