Skip to content


Subversion checkout URL

You can clone with
Download ZIP
Tree: 680a320dff
Fetching contributors…

Cannot retrieve contributors at this time

executable file 13 lines (10 sloc) 581 Bytes
\chapter{Newick order}
There are many ways of visiting a tree. One can start from the root and
proceed to the leaves, or the other way around. One can visit a node before
its children (if any), or after them. Unless specified otherwise, the
\nutils{} process trees as they appear in the \nw{} data. That is, for
tree \texttt{(A,(B,C)d)e;} the order will be A, B, C, d, e.
This means that a child always comes before its parent, and in particular,
that the root comes last. This is known as reverse post-order traversal, but
we'll just call it "\nw{} order".
Jump to Line
Something went wrong with that request. Please try again.