Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 8 - Data Abstractions - Section 8.1 - Basic Data Structures - Questions & Exercises - Page 377: 5

Answer

The leaf (or terminal) nodes are D and C. B must be the root node because all the other nodes have parents.

Work Step by Step

The leaf (or terminal) nodes are D and C. B must be the root node because all the other nodes have parents.
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.