Which of the following is FALSE about B/B+ tree
(A) B/B+ trees grow upward while Binary Search Trees grow downward.
(B) Time complexity of search operation in B/B+ tree is better than Red Black Trees in general.
(C) Number of child pointers in a B/B+ tree node is always equals to number of keys in it plus one.
(D) A B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address sizes.
Explanation: Asymptotic time complexity of both is of order logn.
Quiz of this Question
- Data Structures | B and B+ Trees | Question 3
- Data Structures | B and B+ Trees | Question 1
- Data Structures | Binary Search Trees | Question 12
- Advantages of vector over array in C++
- Data Structures and Algorithms | Set 37
- Data Structures and Algorithms | Set 36
- Data Structures | Heap | Question 12
- Data Structures | Linked List | Question 17
- Data Structures | Balanced Binary Search Trees | Question 13
- Data Structures | Balanced Binary Search Trees | Question 12