Binary Tree - What is difference between binary tree and binary search tree?

A Binary Search Tree (BST) is a type of binary tree that follows a specific order in arranging elements. In a BST, the value of the left node is always less than the parent node, and the value of the right node is always greater than the parent node. This order is not necessary in a regular binary tree.