TreeNode.tips(include_self=False)[source]¶Iterates over tips descended from self.
State: Experimental as of 0.4.0.
Node order is consistent between calls and is ordered by a postorder traversal of the tree.
| Parameters: | include_self (bool) – include the initial node if True |
|---|---|
| Yields: | TreeNode – Traversed node. |
See also
traverse(), postorder(), preorder(), pre_and_postorder(), levelorder(), non_tips()
Examples
>>> from skbio import TreeNode
>>> tree = TreeNode.read(["((a,b)c,(d,e)f);"])
>>> for node in tree.tips():
... print(node.name)
a
b
d
e