A binary tree is a fundamental tree data structure in computer science. The key characteristic is that each node can have at most two children, which we call the left child and the right child. This constraint makes binary trees very useful for organizing and searching data efficiently.