1.

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

A. True
B. False
Answer» B. False


Discussion

No Comment Found