Binary Search Tree problem (too)
<< Split from http://cboard.cprogramming.com/c-pro...e-problem.html >>
Hello. I have a problem with the project below. I started doing some things but because I'm not experienced at programming, I would like to help me to resolve to have it ready by Friday which I sumbit to the systems of my school. Sorry for my English but I am from Greece and the anxiety now affect.
Information on each antenna connections stored in binary
search trees (binary search trees) that will allow the introduction
insertElement and deletion removeElement telephone {number, eventNo}. As
considered key to the phone number. So for each node of the tree
telephone numbers of the left sub-tree is smaller than the number
phone hub and phone numbers of the right sub-tree
older. No need to write code to keep the tree
balanced. Information on each antenna connections stored in a table
fragmentation. To use the key number. When
more than one key corresponding to a position of hash table
then the corresponding objects placed in a binary tree.
If you need to make some extra things that will be right you have the ok from me...
Please help! I'm desperate...