A binary tree is a dynamic data structure made up of two-pointed vertices of the same type.
It is customary to call one of the colored heads "Ben Shemali" and the other "Ben Rightist".
It is also customary to call the first point, the one without a vertex pointing to it,
the "root" of the tree and the vertices that do not point to other vertices of the tree.