Implement the perfect hashed data structure discussed in this chapter and provide an application that demonstrates that its four basic operation methods function properly. Your

Question

24 users unlocked this solution today!

Implement the perfect hashed data structure discussed in this chapter and provide an application that demonstrates that its four basic operation methods function properly. Your application should store nodes for a stadium ticket application where the ticket numbers range from 2000 to 100,000 for a 60,000 seat stadium. The ticket number will be the key field and the nodes will also store the purchaser's name. See Figure 5.4 for a description of the field widths.

Ticket number 342556 4 bytes Mr. Jones Name 28 bytes