Binary Search Tree
1. Time complexity of searching in a binary search tree is
2. Time complexity of deleting from a binary search tree is
3. Time complexity of deleting from a balanced binary search tree is
4. If all the queries in a BST come after all the insertions and deletions, then which of the following algorithms is faster than a BST at the same task: