Question

5. Which type of tree guarantees a better balance in the worst case, AVL trees or Red-Black trees?

7. Suppose we wanted a hash table to store data on 30 students in a lab section. We are considering two options, one is to have 31 bins and to use the day of the month from their birthday (from 1-31), the second is an algorithm that gives a perfectly even distribution using name data and is O(n3 ) – where n is the length of the student’s name. Which is better and why?

This is c language. Please help me to get corrrect answers with explanations

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

The AVL trees are more balanced compared to Red-Black Trees, but they may cause more rotations during insertion and deletion. So if your application involves many frequent insertions and deletions, then Red Black trees should be preferred. And if the insertions and deletions are less frequent and search is a more frequent operation, then AVL tree should be preferred over Red-Black Tree.

Note: Brother According to HomeworkLib's policy we are only allowed to answer first part if there are many. So, I request you to post other part as separate posts

Kindly revert for any queries

Thanks.