1. B-Tree B-Tree is an m-way search tree with the following properties:
The root is either a leaf or it has 2 … m subtrees.
All internal nodes have at least [m/2] non-null subtrees and at most m non-null subtrees.
All leaf nodes are at the same level; that is, the tree is perfectly balanced.
A leaf node has at least [m/2] – 1 and at most m – 1 entry

2. A B-Tree of order 5
ORDER
Number of Subtrees
Minimum
Maximum 3 4 5 6 …… m 2
…..
[m/2]
A leaf node has at least [m/2] – 1 and at most m – 1 entry

3. Draw the B-tree of order 4 created by inserting the following data arriving in sequence: 92 24 7 6
A leaf node has at least [m/2] – 1 and at most m – 1 entry (min:2-1=1 and max:4-1 ENTRY)
All internal nodes have at least [m/2] non-null subtrees and at most m non-null subtrees.
(min 2 subtrees dan 4 subtrees) 24 6 7 92