Hey I am struggling with proving this question:
Proving that Deleting a Node from a 2-3 B-Tree that has inside each of his nodes only one element decreases the height by 1,
I would glad if someone could help me prove this (Formally)
Thank you
Tried induction on height, and then assuming truth for 1<=k<=h and to prove for h+1,
and then continued without loss of generality, that for right subtree, removing a node decrease height by 1
but got stuck from there.