A generic tree with at most two child nodes for each parent node is known as a binary tree.
A binary tree is made of nodes that constitute a left pointer, a right pointer, and a data element. The root pointer is the topmost mode in the tree.
The left and right pointers recursively point to smaller subtrees on either side.
An empty tree is also a valid binary tree.
A binary tree is either empty point is made of a single node, where the left and right pointers each point to a binary tree.