Section 9.3
Section 9.3. Tree Traversal. Universal Address System. In ordered rooted trees, vertices may be labeled according to the following scheme: choose a root node and label it 0 each of root’s k children are labeled, left to right, as 1, 2, … , k
413 views • 25 slides