遍歷二叉樹 的英文怎麼說

中文拼音 [biànlìèrchāshù]
遍歷二叉樹 英文
traversing binary tree
  • 遍 : Ⅰ副詞（全面;普遍） all around; all over; everywhere Ⅱ量詞（動作的全過程） time in repetition
  • 歷 : Ⅰ名詞1 （經歷） experience 2 [天文學] （歷法） calendar 3 （歷書; 年鑒; 歷本） almanac Ⅱ動詞（經...
  • 二 : Ⅰ數詞（一加一后所得） two Ⅱ形容詞（兩樣） different
  • 叉 : 叉動詞[方言] （擋住, 卡住） block up; jam
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  1. In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree

    特別在軟體設計研究中，提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法；提出了類滿二叉排序樹的定義；提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法，它充分利用了折半查找和順序查找各自的優點；提出了浮點運算乘法的改進演算法；並在mcs - 51匯編語言層次上對所有的演算法加以實現。
  2. Traversing binary tree

    遍歷二叉樹
  3. In this paper, we discuss a kind of filter generator whose filter functions have less input bits than the degree of the linear feedback shift register ( lfsr ). by analyzing the structure of the filter generator and its equivalent system, we give out a conditional search algorithm ( csa ) to attack this kind of filter generators

    針對濾波函數f （ x ）的輸入比特數m少於線性反饋移位寄存器級數n的濾波生成器，本文通過分析其等價的組合生成器的結構，以及不同節拍上驅動序列的各個符號之間的制約關系，給出了廣義解序列的概念，並提出了類似遍歷二叉樹的條件搜索演算法csa ，用於攻擊該類特殊的濾波序列。
  4. According to binary tree level traversal principle, this article embarks from fully binary tree ' s definition and the nature, and proposes a method to judge fully binary tree on the basis of traversing binary tree

    摘要從完全二叉樹的定義及性質出發，根據二叉樹的層次遍歷原則，提出了一種遍歷法判斷完全二叉樹的方法。
  5. A discussion on the recursive program

    二叉樹後序遍歷的非遞歸化演算法討論
  6. The recursive and non - recursive algorithm of post - traversing binary tree

    二叉樹後序遍歷的遞歸和非遞歸演算法
  7. In chapter 3, for the case that the terrain data can not fit in memory, we describe a data layout technique of providing coherent access to the terrain data that are consistent with our mesh simplification. we reorder the data in a manner that is of multiresolution and the overhead is completely eliminated

    第三章中，為了能處理超出內存容量的地形數據，我們對海量地形數據進行了重新組織，設計了一種基於層次二叉樹的遍歷方式的頂點存儲方式，存儲的頂點數據是多解析度組織的，並且沒有冗餘。
  8. It presents the arithmetic that is achieved by postorder traversing binary tree, which is built from aov diagraph, based on investigating the arithmetic of interchanging between the ladder diagram and instruction list, and the interpretation and execution of plc programming language. the whole software is developed in visual c + + ide with mfc and multi - threads mechanism. the software is well constructed and conforms to a standard of iec61131

    在重點研究了編程軟體中梯形圖與指令表程序的轉換演算法以及指令解釋執行的原理和方法的基礎上，提出了由aov有向圖建立二叉樹、並對其進行後序遍歷來實現梯形圖程序與指令表程序轉換的演算法，並給出了演算法在編程軟體中的具體實現。
  9. Because any component ( including segtion of line ) in distribution network belongs to the main line or branch line, this aogorithm classfies all the components in the distribution network into two type of aggregated components, feeder - node component and branch line - node component, and thinking the component fault is equivalent to the corresponding node component fault, adopting binary tree as the model of distribution network is very fast to traverse all the nodes and search of any node in the network

    根據配電網路中任一元件位於饋線或分支線這一特點，將整個網路的元件組合成饋線節點和分支線節點兩種集合元件，從而將元件故障等效為相應的節點故障，實現對配電網路模型的簡化，採用二叉樹模型作為演算法的數據結構，易於實現對整個網路節點的遍歷及節點的搜索。
分享友人
分享到 Line

分享到臉書