## Discussion Forum

Que. | Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. |

a. | O(1) |

b. | O(log n) |

c. | O(n) |

d. | O(n log n) |

Answer:O(log n) |