Construct the
universal address system for the given ordered rooted tree. Then use this to order its
vertices using the lexicographic order of their labels.