a) insertion, deletion, finding predecessor, successor
b) only insertion
c) only finding predecessor, successor
d) for sorting
What are the operations that could be performed in O(logn) time complexity by red-black tree?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
What are the operations that could be performed in O(logn) time complexity by red-black tree?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!