Binary Tree : formal definition
A binary tree is a set T of nodes such that either
T is parameterized into three disjoint sets:
- A single node r, the root
- Two possibly empty sets that are binary trees called left and right subtrees of r.
Example : Binary trees to represent algebraic expressions.