B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

› Category: Questions › B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
 
(a) True
 
(b) False
 
My question is taken from B-Trees topic in section B-Trees of Data Structures & Algorithms I
 
This question was posed to me at a job interview.

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

Right answer is (a) True
 
Best explanation: Both the B-tree and the AVL tree have O(log n) as worst case time complexity for insertion and deletion.


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