Question

5. Answer the following questions regarding Red Black trees:

What are the operations that could be performed in O(log n) time complexity by red-black tree? (5 p)
Insert the following sequence in to a red black tree (show each step): 5, 6, 1, 9, 2, 4, 3, 8, 7 (15 p)

Answer 1

Answer:

a) insertion, deletion, finding predecessor, successorb) only insertionc) only finding predecessor, successord) for sortingAnswer: aExplanation: We impose restrictions (refer question 2) to achieve logarithm time complexities.

i don't know about question number 2