bintree

基本解釋

By organizing data block partition, two layer nested bintree were built.
在數(shù)據(jù)分塊組織的基礎(chǔ)上構(gòu)建了兩層嵌套二叉樹。
The loops are then linked together in an order conforming to the sequence of bintree traversal.
然后通過遍歷該二叉樹來確定各環(huán)域的連接順序，對需要穿越的環(huán)域?qū)⑸梢粭l縱向連接路徑；
An organization approach of massive terrain dataset based rectangular bintree and non-pointer data index is put forward for organization and management of massive terrain dataset.
摘要針對海量地形數(shù)據(jù)組織與管理，提出了一種矩形二叉樹模型和無指針數(shù)據(jù)索引相結(jié)合的地形數(shù)據(jù)組織方法。
The whole embroidery region is first decomposed into a series of closed loops and organized into a bintree according to the inclusion relationships among loops.
摘要首先將刺繡區(qū)域劃分成拓撲連續(xù)的環(huán)域，根據(jù)環(huán)域之間的相互包含關(guān)系將它們組織成一個二叉樹；
Bintree its optimization and improve the query efficiency play an important role, it is dynamic to find a very important method, which in the actual production has a broad application.
它對二叉樹的優(yōu)化和提高查詢效率有重要的作用，它是動態(tài)查找的一個非常重要方法，它在實際生產(chǎn)中有著廣泛的應(yīng)用。