What are the operations that could be performed in O(logn) time complexity by red-black tree?
Posted: Wed Jul 13, 2022 7:42 pm
a) insertion, deletion, finding predecessor, successor
b) only insertion
c) only finding predecessor, successor
d) for sorting
b) only insertion
c) only finding predecessor, successor
d) for sorting