Yes, a binary tree can be a maxheap. Consider a binary search tree with two values 3 and 5, where 5 is at the root. The tree is complete, satisfies the heap property and, therefore, it is a heap.