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.
Answer: (B)
Explanation: Asymptotic time complexity of both is of order logn.
Quiz of this Question
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
… [Trackback]
[…] Information to that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-4/ […]
… [Trackback]
[…] Read More Info here on that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-4/ […]
… [Trackback]
[…] Read More Information here on that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-4/ […]
… [Trackback]
[…] Here you can find 34273 more Information on that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-4/ […]
… [Trackback]
[…] Information to that Topic: geeksforgeeks.org/data-structures-b-and-b-trees-question-4/ […]