Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?

• A. insertion takes less time
• B. deletion takes less time
• C. searching takes less time
• D. construction of the tree takes less time than binary heap