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

In a Binary search tree, all the nodes are arranged in a specific order - nodes to the left of a root node have a smaller value than its root, and all the nodes to the right of a node have values greater than the value of the root.