binary tree
A linked structure where each node points to at most two child nodes, a left and a right.
A binary tree is a rooted tree in which each node has at most two children, stored as nodes with left and right pointers (nullptr for a missing child).
See also