Question: what is the difference between the binary-search-tree property and the min-heap property?
Answer: What is the difference between the binary-search-tree property and the min-heap property? ... If B is a binary search tree, then x is greater than or equal to its left child, and less than or equal to its right child. If B is a min-heap, then x is less than or equal to its two children.