A binary tree is a hierarchical data structure in which each node has at most two children. Binary trees are used to represent ordered data and support efficient searching and sorting. Different variants provide different performance characteristics. Example: A binary search tree storing sorted values.
