this is a Implementation of a B* tree,not yet completed, because I need help for this task.
標(biāo)簽： this Implementation completed because
上傳時(shí)間： 2013-11-27
上傳用戶：xinyuzhiqiwuwu
數(shù)據(jù)結(jié)構(gòu)B-TREE的java實(shí)現(xiàn)，按照CLRS的思路描述，通過測試~
標(biāo)簽： B-TREE java 數(shù)據(jù)結(jié)構(gòu)
上傳時(shí)間： 2013-12-11
上傳用戶：xinyuzhiqiwuwu
樣板 B 樹 ( B - tree ) 規(guī)則 : (1) 每個(gè)節(jié)點(diǎn)內(nèi)元素個(gè)數(shù)在 [MIN,2*MIN] 之間, 但根節(jié)點(diǎn)元素個(gè)數(shù)為 [1,2*MIN] (2) 節(jié)點(diǎn)內(nèi)元素由小排到大, 元素不重複 (3) 每個(gè)節(jié)點(diǎn)內(nèi)的指標(biāo)個(gè)數(shù)為元素個(gè)數(shù)加一 (4) 第 i 個(gè)指標(biāo)所指向的子節(jié)點(diǎn)內(nèi)的所有元素值皆小於父節(jié)點(diǎn)的第 i 個(gè)元素 (5) B 樹內(nèi)的所有末端節(jié)點(diǎn)深度一樣
上傳時(shí)間： 2017-05-14
上傳用戶：日光微瀾
all traversals in binary search tree with simple coding..
標(biāo)簽： traversals binary coding search
上傳時(shí)間： 2017-05-16
上傳用戶：kytqcool
If a tree falls in the forest, and there s nobody there to hear, does it make a sound? This classic conundrum was coined by George Berkeley (1685-1753), the Bishop and influential Irish philosopher whose primary philosophical achievement is the advancement of what has come to be called subjective idealism. He wrote a number of works, of which the most widely-read are Treatise Concerning the Principles of Human Knowledge (1710) and Three Dialogues between Hylas and Philonous (1713) (Philonous, the "lover of the mind," representing Berkeley himself).
標(biāo)簽： there classic forest nobody
上傳時(shí)間： 2013-11-26
上傳用戶：stvnash
Decision Tree Decision Tree Decision Tree
上傳時(shí)間： 2014-11-22
上傳用戶：aeiouetla
b+ tree code implementation and insertion deletion
標(biāo)簽： implementation insertion deletion tree
上傳時(shí)間： 2017-05-20
上傳用戶：來茴
steiner tree工具，利用率挺高的，計(jì)算minial steiner tree時(shí)候可以看看
上傳時(shí)間： 2017-05-22
上傳用戶：15736969615
Article:Reconstructing 3D Tree Models from Instrumented Photographs
標(biāo)簽： Reconstructing Instrumented Photographs Article
上傳時(shí)間： 2017-05-24
上傳用戶：zhangjinzj
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
標(biāo)簽： followingconditions tree completely satisfying
上傳時(shí)間： 2017-05-25
上傳用戶：2467478207
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
