a) True
b) False
B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!