Vidyalelo
Data Structure · Q94

Advanced Trees (AVL, RedBlack, BTrees)

Programming · Data Structure · question 94

Q94

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

A.
True
Answer
B.
False

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board