Designing a Binary Search Tree in C++ ?

Design a class template Table as the table to store the information of the people and another class Person to represent each individual person of the people in a table. The data structure of a table is the pointer-based binary search tree (BST). A table of people is an object of the class Table. The information of each person is store in a node, which is an object of the class Person. A relational database is conceptually a collection of tables (files). A table is abstractly a collection of to records (attributes).The information of a person consists of her (his) name, sex (male or female), birthday, address, city and phone number. Assume the names of the people are unique. The search key is the person’s name. Our program should be able to save a table for use later. We should be able to retrieve the information of a subgroup of people based on a given criterion. I need Add , Print , Delete and Save functions.

Designing a Binary Search Tree in C++ ?
Yeah, please leave Computer Science. You'll never be any good at it, since you don't do your own work. The world doesn't need people like you writing software for Air Traffic Control, radiation therapy machines, or even financial institutions. Do us all a favor and become a hair stylist. The worst that will happen there is that you give someone a bad haircut.
Reply:Do your own homework... your not asking a question your asking someone to do it all for you...

jasmine