Binary Tree is a data structure in which each node has at most two child nodes, typically referred to as left and right. Used in searching, sorting, and hierarchical data representation.
Example:
A binary search tree stores student records for fast lookup.
