QUESTION 1 Which of the following applications is not suitable using trees? O Hierarchical structure Faster search Remove maximum or minimum Undo/Redo operations 7 QUESTION 2 Which of the following is the advantage of a binary search tree? O We can always keep insertion, deletion and look up to Ollogn). We may retrieve keys in order by using postorder traversal. The cost for insertion is O(1) while searching is O(log n). We can search the maximum key in constant time