Suppose that the address of the vertex v in the ordered rooted tree T is 3.4.5.2.4.
a) At what level is v?
b) What is the address of the parent of v?
c) What is the least number of siblings v can have?
d) What is the smallest possible number of vertices in T if v has this address?
e) Find the other addresses that must occur.
Suppose that the vertex with the largest address in an ordered rooted tree T has address 2.3.4.3.1. Is it possible to determine the number of vertices in T ?