What is a binary tree and what are its properties?

A binary tree is a hierarchical data structure where each node has at most two children, referred to as left and right child. Key properties include: the topmost node is the root, nodes with no children are leaves, the height is the longest path from root to leaf, and a binary tree with n nodes has n-1 edges. Binary trees are used for hierarchical data representation, searching, and expression evaluation.