Difference between binary tree and binary search tree

Question

Can anyone please explain the difference between binary tree and binary search tree with an example?

Answer 1

A binary search tree is a special kind of binary tree which exhibits the following property: for any node n, every descendant node's value in the left subtree of n is less than the value of n, and every descendant node's value in the right subtree is greater than the value of n.