How to distinguish a binary tree from a red-black tree and how do they differ in implementation and properties?

A binary tree is a data structure where each node has up to two children. A red-black tree is a balanced binary search tree with additional properties (node colors, black-height). Differences include structure, properties, balancing, and implementation details, with an example in Java.