1

i am having a bunch of nodes holding some data . this can be considered as leaf nodes. I want to build an ISAM tree over these nodes. Is there a standard way of creating the non leaf nodes of an ISAM tree /B plus tree / any tree for that matter. How to implement the tree structure.

Constraints: The height of the tree cannot be assumed. all the non leaf nodes should be full except the rightmost one.

I am planning on using a list structure to hold the key-value and node-index.

Thanks

kbang
  • 694
  • 9
  • 25
  • Please comment if any more information is needed about the existing design / data – kbang Mar 21 '13 at 23:23
  • This answer shows one way of doing that: http://stackoverflow.com/questions/3401009/sequentially-constructing-full-b-trees?rq=1 – 500 - Internal Server Error Mar 22 '13 at 00:17
  • what would be the height of this tree? and also if i implement this using a while loop what is the condition i have to use? I am thinking i will use log_2 (number of leaf nodes / data records per node) Really confused !!!! – kbang Mar 22 '13 at 01:02
  • My theory on that is a bit rusty - isn't it going to be something like logn(X) where n is the number of keys per node and X is the number of total keys in the tree? – 500 - Internal Server Error Mar 22 '13 at 04:14
  • we both have said the same thing mathematically... one more thing.. do u mean to say X is number of leaf nodes in the tree – kbang Mar 22 '13 at 06:02
  • i am trying to use list of lists in java to store each level of this tree . any help on this would be appreciated – kbang Mar 22 '13 at 06:14
  • Can any one tell me the relation ship between the index node and the leaf page . in case of binary tree it is 2n , 2n+1 . will it be (no of child)*n ? – kbang Mar 22 '13 at 07:21
  • This is called a [B+ tree](https://en.wikipedia.org/wiki/B%2B_tree). – doug65536 Apr 10 '16 at 01:23

0 Answers0