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

• Binary search tree: when inorder traversal is made on binary tree, you get sorted values of inserted items
• Binary tree: no sorted order is found in any kind of traversal