B+ tree

Question

How to prove that if no of leaf nodes in a B+ tree is n then total no of keys in internal nodes will be n-1.
I  am able 2 prove it by taking min no of nodes  or maximum no of nodes but how 2 prove in a generalized way ??

Comments

I am trying to give one logic to prove this -

Whenever there is an overflow in a leaf node( or whenever no of leaf node increases by one) , then we move a key in the internal node( or we can say, no of internal keys increases by one).

Now let's start with the base case. - Only one node. or root node. no internal key.

Once there is an overflow in a single root node then no of leaf nodes now would become 2 and at the same the time we will have one key in our new root node.

Similarly, ..  ......

Am I right ?

---

that is ok ..... u r right
actually u can prove it mathematicaly by taking min or  max no of nodes so i m thinking that there may b similar proof in general...