In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
A prefix is a sequence of values that appear at the beginning of a larger data structure. In computer science, algorithms that use prefixes are often used for tasks like searching, sorting, and string matching.