a vertex of a rooted tree is called a leaf if it has no children. vertices that have children are called internal vertices. if d is a vertex in a tree, the with d as its root is the subgraph of the tree containing d and its descendants and all edges incident to these descendants.