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.4 - A Short Case Study - Questions & Exercises - Page 399: 4

Answer

At each node, each child pointer could be used to represent a unique letter in the alphabet. A word could be represented by a path down the tree along the sequence of pointers representing the spelling of the word. A node could be marked in a special way if it represented the end of a correctly spelled word.

Work Step by Step

At each node, each child pointer could be used to represent a unique letter in the alphabet. A word could be represented by a path down the tree along the sequence of pointers representing the spelling of the word. A node could be marked in a special way if it represented the end of a correctly spelled word.
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.

GradeSaver will pay $15 for your literature essays
GradeSaver will pay $25 for your college application essays
GradeSaver will pay $50 for your graduate school essays – Law, Business, or Medical
GradeSaver will pay $10 for your Community Note contributions
GradeSaver will pay $500 for your Textbook Answer contributions