• Understand how the AVL tree works
• Give you further practice with C and data structures
Marks 10 marks, excluding bonus marks. Marking is based on the correctness and
efficiency of your code. Your code must be well commented.
Group? This assignment is completed individually.
Due Time 23:59:59 pm on Sunday 31 March 2019. 23:59:59 pm on Wed 3 April 2019
Late Submissions Late submissions will not be accepted!
In this assignment, you will implement AVL tree and a set of functions associated with AVL
tree. For simplicity, we make the following assumptions:
1. Each item of an AVL tree contains an integer key and an integer value.
2. No AVL tree contains duplicate items. Two items (k1, v1) and (k2, v2) are duplicates
iff k1=k2 and v1=v2 hold.
3. An AVL tree may contains multiple items with the same key and the number of
duplicate keys is a constant.
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.Read more
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.Read more
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.Read more
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.Read more