Properties of B tree

Rule of B tree

  1. All leaves are at the same level
  2. Insertions can only happen into leaf nodes
  3. B trees grow (add a new level) from the root upwards
  4. All internal nodes must have (#no of values + 1) nodes

General Properties of B tree

  1. B trees are widely ased as the data structure for many databases
  2. B trees are self balancing
  3. B trees reduce the no of memory acess operations needed