F ferrari_M New member Joined Feb 28, 2019 Messages 1 Feb 28, 2019 #1 Let B be a B-tree of order m, containing N items. Prove by induction that B has N+1 leaves. I know that you should use induction on the depth of the tree, but how?
Let B be a B-tree of order m, containing N items. Prove by induction that B has N+1 leaves. I know that you should use induction on the depth of the tree, but how?
