您要查找的是不是:
- 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. 多邊形是以點的形式在二叉樹中存儲的。
- A new slot assigning scheme is presented based on the characteristic of a new TDMA peer-to-peer tactic network with hub,which uses binary tree and dynamic weight. 針對一種新型的有中心節點控制TDMA端到端戰術通信網路結構特點,提出了一種時隙分配策略,融合了二叉樹法和動態加權思想,建立了時隙資源分配模型。
- The multiclass SVM methods based on binary tree are proposed. 摘要提出一種新的基於二叉樹結構的支持向量(SVM)多類分類演算法。
- The model is a generalization of conventional binary tree algorithm. 模型是傳統的二元樹形演算法的推廣。
- Using Binary tree to save the text in sepecific file and catalogue, Delphi. 用二叉樹的演算法對指定目錄下的文件和目錄以格式化的方法保存。
- 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. 所以,該演算法採用最小超立方體和最小超球體類包含作為二叉樹的生成演算法。
- The article presents the recursive and non-recursive algorithms of postorder-traversing binary tree. 摘要本文論述了後序遍歴二叉樹的遞歸演算法和非遞歸演算法。
- The binary tree consists of a single-root node and a set of terminal and nonterminal nodes. 介詞十動名詞短語代替定語從句或狀語從句。
- Then identity-based binary tree encryption scheme is constructed.As a result, a concrete IBE-NIKU is given. 基於已有的二叉樹加密構造了基於身份的二叉樹加密方案及非互動式密鑰更新的基於身份加密方案;
- This paper uses P2P technology, through designs one in the application layer to carry on based on P2P cover tree network flows the media data the distribution. 摘要文章利用P2P技術,通過在應用層設計一個基於P2P的覆蓋樹網路來進行流媒體數據的分發。
- An algorithm that traverses a general binary tree will have complexity O( 2 N ). 一個演算法,遍歷一般二叉樹將複雜性為O(2 N)段。
- This paper gives the algorithms inseting root-node and binary tree in all threaded binary tree. 給出了在全線索二叉樹中插入結點和二叉樹的演算法,然後闡述了這種運算的特點。
- Design requirements: the use of Kruskal algorithm for minimum spanning tree network to the text of the various forms of output spanning tree edges and their weights. 設計要求:利用克魯斯卡爾演算法求網的最小生成樹;以文本形式輸出生成樹中各條邊以及它們的權值。
- This paper analyzed the relation between the complete binary tree nodes and the leaves number by two ways. 該文從兩個角度分析了完全二叉樹的總結點數與葉結點數之間的關係。