Chapter 7. Binary Trees

Binary trees are a special case of trees in which each parent can have at most only two children that are ordered. There are no children, a left child, a right child, or both a left and a right child at each node. Binary trees are the subject of many chapters in data structures books because they have such nice mathematical properties. For example, the number of distinct binary trees with (n) nodes is called a Catalan number and is given by the formula ((2n)!/((n + 1)!n!)).

Binary trees ...

Start Free Trial

No credit card required