Q. B-tree of order n is a order-n multiway tree in which each non-root node contains (Solved)
1. at most (n – 1)/2 keys
2. exact (n – 1)/2 keys
3. at least 2n keys
4. at least (n – 1)/2 keys
- d. at least (n – 1)/2 keys
1. at most (n – 1)/2 keys
2. exact (n – 1)/2 keys
3. at least 2n keys
4. at least (n – 1)/2 keys