An internal node of a tree is any node which has degree greater than one. Or, phrased in rooted tree terminology, the internal nodes of a tree are the nodes which have at least one child node.
![$\displaystyle \begin{xy} *!C\xybox{ \xymatrix{ & {\color{red}\bullet} \ar@{-}[d... ...{\color{red}\bullet} \ar@{-}[dl] & & \bullet & \ \bullet & & & & } } \end{xy}$](http://images.planetmath.org:8080/cache/objects/2740/l2h/img1.png "$\displaystyle \begin{xy} *!C\xybox{ \xymatrix{ & {\color{red}\bullet} \ar@{-}[d... ...{\color{red}\bullet} \ar@{-}[dl] & & \bullet & \ \bullet & & & & } } \end{xy}$")