Implementing priority queue using max heap vs balanced BST

Question

Balanced BST and max heap both perform insert and delete in O(logn). However, finding max value in a max heap is O(1) but this is O(logn)