%This command provides the command to typeset the part about
%the trees in the page 2
%
%This command has one parameter
%     1) The width of the text
\newcommand\TTwoTree[1]{%
   \parbox[t]{#1}{%
      \TTwoTreeFontSize
      Every tree with $n$ vertices has $n-1$ edges.

      \AdjustSpace{-1ex plus .5ex minus .5ex}
      \TTwoTitle{Kraft inequality:}
      \begin{DisplayFormulae}{1}{0pt}{2ex plus 1ex minus 1ex}{\SmallChar}{\StyleWithoutNumber}
         \unskip
         If the depths of the leaves of a binary tree are \Fm[true]{d_1 \cdots d_n}:
         \Fm[true]{\sum_{i=1}^n 2^{- d_i} \leq 1},
         and equality holds only if every internal node has 2 sons.
      \end{DisplayFormulae}
   }%
}