What is the difference between a heap (a minheap) and a binary search tree?

Some differences between Heap and Binary search trees are as following:-

A heap is a complete binary tree. While a Binary Search Tree may be a complete, prefect binary tree.

A minheap the root should be minimum than it's children So it efficient for finding minimum and maximum. While Binary search trees have different properties the root node should be greater than the left child and should be less than the right child.