What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree?
O(n) for all
O(Logn) for all
O(Logn) for search and insert, and O(n) for delete
O(Logn) for search, and O(n) for insert and delete