Construct the universal address system for the given ordered rooted tree. Then select the correct order of the vertices using the lexicographic order of their labels.