Confirms if the invariants of btree stands:
1. All leaves have the same height - h
2. Every node other than the root must have at least degree - 1
keys. If the tree is nonempty, the root must have at least one
key.
3. Every node may contain at most 2degree - 1 keys - enforced through
the array range exception
4. The root must have at least two keys if it's not a leaf.
5. The elements stored in a given subtree all have keys that are
between the keys in the parent node on either side of the subtree
pointer.
Confirms if the invariants of btree stands: 1. All leaves have the same height - h 2. Every node other than the root must have at least degree - 1 keys. If the tree is nonempty, the root must have at least one key. 3. Every node may contain at most 2degree - 1 keys - enforced through the array range exception 4. The root must have at least two keys if it's not a leaf. 5. The elements stored in a given subtree all have keys that are between the keys in the parent node on either side of the subtree pointer.