Efficiency of finding the next record in B+ tree is ____

› Category: Questions › Efficiency of finding the next record in B+ tree is ____
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

Efficiency of finding the next record in B+ tree is ____
 
(a) O(n)
 
(b) O(log n)
 
(c) O(nlog n)
 
(d) O(1)
 
The above asked question is from B-Trees in chapter B-Trees of Data Structures & Algorithms I
 
The question was asked in exam.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

Correct choice is (d) O(1)
 
Best explanation: In a B+ -tree finding the next recored (successor) involves accessing an additional leaf at most. So, the efficiency of finding the next record is O(1).


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701

Related Posts