C Programming, using BST (a small program)

It is required to implement program which is used to store student’s data in a certain organisation. Each student has ID, name fields. Many operations will be done such as: [login to view URL] (by name and ID) Handling errors is required (can’t insert name without ID or ID without name , name should be characters and ID should be numbers) [login to view URL] (by name or ID and in both situations you have to display the whole record of the Student “name, ID”) [login to view URL] (by name or ID and in both situations you have to delete the whole record of the Student “name, ID”) [login to view URL] the data at any time using inorder, preorder or postorder Algorithm (let me choose which way I want to print it) (you can print it in a file if you want) 5. You have to use binary search trees to store the data so you have to meet its characteristics while storing data (it always has to remain a valid binary search tree after all operations). [login to view URL] program have to read input file from the user contains the students data which have to be stored with comma separated (name, ID) 7. You have to deliver a REPORT which contains your work structure, methods, main test cases (How your main method works) and a sample run with screen shots. A menu for choosing which operation to be done of course. Don't need GUI, just working on terminal.