write a program to

Question

Write a program to implement phone book dictionary using Binary Search Tree which provides following operations: (a) add new entry in phone book, (b) remove entry from phone book, (c) search phone number (d) list all entries in ascending order of name and (e) list all entries in descending order of name.

Answer 1

I have given you the code for the quicksort and the binary search...

to add a new record to the array, do something like this:

InsertAddnew( int * A, int n, int iNewIntNum)

{

int iReturn=0;

if (n<MAX_CAPACITY)

{

A[n++] = iNewIntNum;

qsort(A,n,sizeof(int),compareInt);

}

else

{

iReturn=-1; //array is full

}

}

yes you can do a 1-pass insertion sort which is ARGUABLY faster than

quicksort on almost sorted arrays, but I don't feel like racking my brains

for deletion, since the array is already sorted, just move

all of the elements GREATER than the target one position

to the left, and then decrement the size