Searching in B tree depends on the height of the tree. In the above tree if we want to look for item 3, then we will proceed as follows: Searching in B tree is similar to that in BST. Given below are some of the Basic operations of B-Tree. Next, we discuss some of the basic operations of B-tree. Every node except the root node and the leaf node contain m/2 children.Root node must have at least two nodes.Every node in B-tree has at most m children.A B-tree of order m can have at most m-1 keys and m children.All leaves of B-tree are at the same level. Listed below are some of the properties of B-Tree. Generally, the node size in B-tree is kept the same as the block size. By keeping the height of the B-tree to the minimum, the access is faster when compared to other balanced trees like AVL trees. Instead, as many keys are put in each node of the B-tree. the height of the B tree is kept to a minimum.
0 Comments
Leave a Reply. |