Which of the following is false?
(a) Compared to B-tree, B+ -tree has larger fanout
(b) Deletion in B-tree is more complicated than in B+ -tree
(c) B+ -tree has greater depth than corresponding B-tree
(d) Both B-tree and B+ -tree have same search and insertion efficiencies
I want to ask this question from B-Trees topic in section B-Trees of Data Structures & Algorithms I
I got this question during an interview.