| 11. | Leaf nodes represent examples which end after sending the last message.
|
| 12. | Otherwise, it must find a leaf node to replace its position.
|
| 13. | Cut a tip about six inches long, including at least two leaf nodes.
|
| 14. | A finished tree has up to n leaf nodes and n-1 internal nodes.
|
| 15. | If this node is a leaf node, it can leave the network safely.
|
| 16. | Unrooted trees illustrate the relatedness of the leaf nodes without making assumptions about ancestry.
|
| 17. | Then, assuming x exists, we remove the corresponding leaf node.
|
| 18. | In the latter form, roots may develop at leaf nodes.
|
| 19. | For the base case where R is a leaf node, no replacement is required.
|
| 20. | Intuitively, the packing algorithm should ideally assign nearby points to the same leaf node.
|
