QUESTION 1 Which of the following is the advantage of a binary search tree? O We can always keep insertion, deletion and look up to O(logn). O We may retrieve keys in order by using postorder traversal. O The cost for insertion is (1) while searching is o(logn). O We can search the maximum key in constant time