Submit to Blackboard before the deadline. You will be able to revise your answers until the deadline with no penalty.
node insert_to_node(node my_node, Item item)
void split_root(node my_node)
void split_node(node my_node)
IMPORTANT: to simplify the implementation, assume that the tree does not contain duplicate keys. When we have a function call insert(my_tree, item)
where my_tree already contains a key equal to item.key, the function does nothing, i.e., it refuses to insert the item. Note that this case is already handled in the code that you are given, in the implementation of the int insert(tree my_tree, Item item)
function.
Submit your function in a program called 234_trees.c.
The assignment should be submitted via Blackboard. Submit a file called 234_trees.c.
As stated on the course syllabus, programs must be in C, and must run on omega.uta.edu.
IMPORTANT: Pay close attention to all specifications on this page, including file names and submission format. Even in cases where your answers are correct, points will be taken off liberally for non-compliance with the instructions given on this page (such as wrong file names, wrong compression format for the submitted code, and so on). The reason is that non-compliance with the instructions makes the grading process significantly (and unnecessarily) more time consuming. Contact the instructor or TA if you have any questions.
Back to the list of assignments.