## Discussion Forum

Que. | The worst case time complexity of AVL tree is better in comparison to binary search tree for |

a. | Search and Insert Operations |

b. | Search and Delete Operations |

c. | Insert and Delete Operations |

d. | Search, Insert and Delete Operations |

Answer:Search, Insert and Delete Operations |