B/B+ TREE

Question

Which of the following statement true about B tree and B⁺ tree index? Assume order of B tree node same as order of B⁺ tree node.

(A) B tree index has more levels than B⁺ tree index for large number of keys.

(B) B⁺ tree index has more levels than B tree index for large number of keys.

(C) Both B tree B⁺ tree best for sequential access of records.

(D) B tree index nodes more than B⁺ tree for large number of keys.

Comments

(A) B tree index has more levels than B⁺ tree index for large number of keys. false b/c of (b)

(B) B⁺ tree index has more levels than B tree index for large number of keys. true since keys are not repeated.

(C) Both B tree B⁺ tree best for sequential access of records. false only B+ tree

(D) B tree index nodes more than B⁺ tree for large number of keys . false b/c of (b)

---

@ Anu007 B tree has more levels than B+ tree SO (A) should be true and (B) should be false and option D is has typo!

---

B tree has more levels than B+ tree  How???

---

because for every node in b tree we hold record pointer and very less block pointer compared to B+ tree where we point to a large no of node result less depth because the data is skewed .

---

explain this ...