Describe B tree

Briefly describe the term B tree?

E

Expert

Verified

A B-tree of order m (maximum number of children for each node) is a tree that satisfies the subsequent properties:

a. Every node has <= m children.
b. Every node (except root and leaves) has >= m/2 children.
c. The root has at least 2 children.
d. All leaves appear in the same level, and carry no information.
e. A non-leaf node with k children contains k – 1 key

   Related Questions in Data Structure & Algorithms

©TutorsGlobe All rights reserved 2022-2023.