// hw3_set.h // //CSc 212: Data Structures (Summer 2013) // set class for homework 3 // –> imple

// hw3_set.h // //CSc 212: Data Structures (Summer 2013) // set class for homework 3 // –> implemented using B-Trees // –> adapted from code written during lectures (7/1/03 – 7/3/03) namespace HW3 { class set { public: typedef int T; set() {entry_count=0; child_count=0;} bool insert(const T&); bool search(const T&); bool remove(const T&); void print(); private: static const int MIN = 3; static const int MAX = 2*MIN; T data[MAX+1]; int entry_count; set* subset[MAX+2]; int child_count; bool is_leaf() {return (child_count == 0);} bool loose_insert(const T&); void fix_excess(int); bool loose_erase(const T&); void remove_biggest(T&); void fix_shortage(int); }; } // end namespace HW3

Looking for a similar assignment? Get 15% discount on your first order with us
Our experts will take care of your task no matter the deadline!
Use the following coupon
"SAVE15"

Order Now