 | This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||
| |||||||||||||||
 | This article may be too technical for most readers to understand. (September 2010) |
what about unrooted trees?
> In the graph theory tree, a leaf node is a vertex of degree 1 other than the root (except when the tree has only one vertex; then the root, too, is a leaf)
If the tree has only one vertex then it's degree is 0, therefore the comment is unnecessary IMHO.
> Every tree has at least one leaf.
What about empty trees?
Merge edit
This should be merged into tree (data structure). Rp (talk) 18:50, 28 September 2009 (UTC)