Question: what is the difference between a general binary tree and a binary search tree?
Answer: A binary tree is a non linear data structure where each node can have at most 2 child nodes. ... Binary search tree is a binary tree in which a node have a value greater than all values in its left subtree and smaller than all values in its right subtree.