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

One of the main advantages of AVL trees over binary heaps is that they are more balanced. This means that operations like insertion, deletion, and search can be performed more quickly in AVL trees, in O(log n) time complexity, where n is the number of nodes. This is because the height of the tree is always kept at log n, ensuring that operations do not have to traverse through more nodes than necessary.

On the other hand, binary heaps do not have this balance property. While they can perform insertions and deletions in O(log n) time, search operations can take up to O(n) time in the worst case, as the element could be anywhere in the heap.

Another advantage of AVL trees is that they can handle queries for the next smallest or largest element more efficiently than binary heaps. This is because AVL trees maintain their elements in sorted order, while binary heaps do not.

In summary, AVL trees offer more efficient search operations and can handle certain types of queries more efficiently than binary heaps due to their balance property and sorted order.