Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 11 - Section 11.1 - Introduction to Trees - Exercises - Page 755: 8

Answer

Level 0: $a$; Level 1: $b, c, d$; Level 2: $e, f, g, h, i$ (in alphabetical order); Level 3: $j, k, l, m, n, o, p$; Level 4: $q, r, s$ ;

Work Step by Step

The level of each vertex of the rooted tree in given is: Level 0: $a$; Level 1: $b, c, d$; Level 2: $e, f, g, h, i$ (in alphabetical order); Level 3: $j, k, l, m, n, o, p$; Level 4: $q, r, s$;
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.