A subtree is a portion of a tree data structure that consists of a node and all its descendants, forming a smaller tree within the larger tree. It is a fundamental concept in computer science, particularly in algorithms and data structures, where operations like traversal, searching, and manipulation often involve working with subtrees.