search binary tree 中文意思是什麼

search binary tree 解釋
二元樹狀搜尋
  • search : vt 1 搜查；檢查（身體、衣袋等）；搜索，搜尋；找；尋找。2 調查；查究；探求；追求；根究 （into）。3...
  • binary : adj. 二，雙，復；【化學】二元的；【數學】二進制的。n. 二，雙，復；雙體，復體；【天文學】雙[聯]星【數學】二進制。
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 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. First, we have expatiated the working principle, performance parameters and major technologies. farther, we have analyzed the shortcomings of the existing catalog search engine and introduced the clustering analysis and the ant algorithm ; on the basis of this, we discussed the possibility and necessity of the connection between them, which avoids the local optimization of the clustering analysis to a degree. in the end, we appraise the idea that we deal with the information data by the data structure of the binary tree, m - branch tree and tree established by the ant algorithm, which can improve the efficiency of the search engine

    首先闡述了搜索引擎的工作原理，性能指標，主要技術；分析了現有目錄式搜索引擎的缺點，接著介紹了聚類分析演算法與螞蟻演算法的理論，並論述了二者結合的可能性和必要性，這種結合方法也在一定程度上克服了聚類分析演算法容易陷入局部最優的缺點，最終提出了通過使用螞蟻演算法建立二叉樹、 m叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  3. A binary search tree is a binary tree with the following properties

    二進制搜索樹（ bst ）是具有以下屬性的二進制樹：
  4. Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently

    二叉搜索樹在查找經常變化的列表時是很非常有用的。
  5. The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree

    在此基礎上，信息的搜索就可描述為二進制搜索樹的查找過程。
  6. Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem

    用一個二叉搜索樹或者將串切分成長度的平方根那麼長的小段都可以解決這個問題。
  7. The core contents of digital power transmission network are to build the true three dimension scene of objective region, to search for the transmission equipments and to operate them in the scene interactively. according to the two main kinds of three dimension digital models ( earth surface model and transmission equipment model ), this thesis describes a simplifying method depended on view - point : it accomplishes displaying and flying over a large area of true earth surface with level of detail model based on block - binary tree. and it realizes " the efficient display of abundant data of equipment models and interactive management by the method of combination of models and images

    構建目標區域的真實三維場景，並在場景中對輸電設備進行查詢和交互操作是數字輸電網路的核心內容，本文針對數字平臺中兩種主要的三維數據模型? ?地表模型及輸電設備模型提出了基於視點的簡化方法：用塊? ?二叉樹結構的動態細節層次模型解決了大區域真實地形的顯示及漫遊方法；用失柵結合的方式實現了對海量設備模型數據的高效顯示及交互管理的功能。
  8. Binary search tree

    二叉查找樹
  9. Add and remove operations are typically expensive since binary search trees require that a tree be balanced

    通常需要增加和刪除操作，因為二叉樹需要被平衡。
  10. In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in xsl would be inconvenient and unnecessary

    在上面的示例中，如果使用一個簡單的散列圖（ hashmap ）或二進制搜索樹就可以輕易地解決問題，但是用xsl實現一個這樣的數據結構並不是很方便，並且是不必要的。
  11. 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

分享到臉書