Difference between Binary Tree and Binary Search Tree.

Both binary tree and binary search tree are data structures that are used in computer programming.

Binary Tree – It is a hierarchical data structure where each node has at most two children often referred to as the left and right child.

Binary Search Tree – It is a type of binary tree with additional properties, where the left subtree should have values less than the node’s value and the right subtree should have values greater than the node value.