What is the difference between a Binary Tree and a Binary Search Tree?

What is the difference between a Binary Tree and a Binary Search Tree?

Approach: Compare structure versus ordering rules.

A binary tree simply means each node has at most two children. A binary search tree is a binary tree that follows the specific ordering property (left < root < right).

Follow-up: Is a balanced binary tree always a BST?

Key concepts: ordering, max two children.