Do it for small value and draw it @srestha
lets say we have 10 keys and order is 3.
so keys in each node is 3-1=2.
now in leaf node we divide by 3 or 2 ? ....we divide by 2
10/2 = 5 nodes. (5 nodes each having 2 keys and 1 pointer pointing to its right node.)
now each of the 5 nodes can be pointed of by 1 pointer
1st node -> 2 value and 3 pointer
2nd node -> 1 value and 2 pointer.
so we need 5 pointers and each node can have 3 pointers
So we need 2 nodes
now each of these 2 nodes can be pointed of by 1 pointer
1st node -> 1 key 2 pointer. = root node
So leaf level is divided by (keys in each node) and non leaf by (child pointers of each node.)