Facebook

b-trees

Deletion In B-Trees

In order to delete elements from B-Tree we need to ensure that their properties(Refer : http://letslearncs.com/b-trees/ does not get violated.It should remain a binary search tree and number of pointers must be according to the order and keys should be one less than the order in each and every node. Example Consider a B-tree of Fig 1.Say… read more »

B-Trees

The B-tree is a generalization of a binary search tree  in which a node can have more than two children .The B-tree is optimized for systems that read and write large blocks of data.It has following properties The data items are stored at leaves. Every node has between M/2 and M children where M is a… read more »

Sidebar