a) balanced binary search trees
b) binary search trees
c) binary trees
d) linked lists
To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!