Programming Homework Help

The following Dictionary ADT is to be completed in C language.

Please look at the attached pa6.pdf as it is the prompt. The Dictionary ADT follows a Binary Search Tree(BST) algorithm. As mentioned in pa6.pdf the main functions in Dictionary.c are lookup(k), insert(k,v) and delete(k) which will be implemented using the BST algorithms that are provided in the pseudocode.txt file.

There is also a gradingscript that our programs are supposed to pass which I will pass to you to be able to test the ADT.