What is the difference between binary search tree and heap?
In binary search tree, for every node except the leaf node, the left child has a less key value and right child has a greater key value. |