Heap versus Tree (Java)?

Heaps tend to be sorted by default, ie, a maxheap or minheap, and they tend to provide methods for popping and pushing items to the heap, where the heap will be sorted according to the elements added and the comparator you passed to it. They're largely used for sorting items or keeping them ordered, ie, a heap is the parent of the priority queue. Trees are much more general.