What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree?

A | O(n) for all |

B | O(Logn) for all |

C | O(Logn) for search and insert, and O(n) for delete |

D | O(Logn) for search, and O(n) for insert and delete |