EECE 330 Homework 4 Assignment, Fall 2011

EECE 330 Assignment # 4 – Fall 2011-2012 In this assignment we keep using the same class “book” that was used in the linked and doubly-linked lists assignments. But this time we store the objects in a binary tree data structures using ISBN as the key. You are to build the book database using a dictionary. Your database should allow records to be inserted, searched by ISBN or subject by using comparator classes, and should print one or all records as needed. The above functions are to be compiled from the slides and available software; you are to write the function that merges two binary trees into one.