APS111H1 Lecture Notes - Binary Search Tree, Dynamization, Memory Management

74 views11 pages

Document Summary

Lab assignment #5: binary search trees: objectives. The objectives of this assignment are to provide you with more practice on the use of the various c++ concepts/constructs introduced in the lectures so far, including classes, dynamic memory allocation, pointers, i/o, and dynamic data structures. This will be done in the context of implementing a binary search tree class: problem statement. In this assignment, you will implement a simple database to store and retrieve data. You are creating a simple domain name server a database that can rapidly look up string names, such as www. google. com, and return a 32-bit integer that is the internet protocol (ip) address corresponding to that domain name . This is the function performed by the domain name servers that allow you to type in easy to remember website names and have your web browser automatically go to the correct ip address (computer) to retrieve the web data. You will implement three classes: dbentry, treenode and treedb.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents