Hi i need to find a solution for this question

[SAHA93]

In the following questions, the set of input data is based on 1171234 The set of numbers you will extract is as follows: N1 = 1st digit; N2 up to N7 = the set of pairs in the number above; N8 = the last digit in your student ID. , then show the extracted pairs in a table containing each pair of consecutive numbers as follows: Original 1st N1 N2 N3 N4 N5 N6 Last St.

Question 1) a. Insert the sequence of generated numbers in the last step into an AVL tree starting with an empty tree and show all your steps.

b. Delete the number 11 from your tree. * For this part, consider that there is no redundancy of the generated pairs.




Question 2) Consider a Hash table of size 13, and the hash function is h (x) = x mod size and consider the original set of pairs generated from your student ID:

a. Using linear probing, generate a hash table to store the sequence of numbers and show all your steps (as shown in the lecture) and the change in the hash table. b. Using quadratic probing, generate a hash table of the sequence of numbers and show all your steps (as shown in the lecture) and the change in the hash table.



Can any one help

[VictorN]

https://forums.codeguru.com/showthre...rk#post1279572

[Arjay]

Victor' that was a well written post from Guido.

[VictorN]

Yes, Arjay! I know it.
Frankly, I miss him...
Do you have some info about Guido?

[2kaud]

Can any one help

What help do you need? What have you done already? What part are you having difficulty with?

Post the code you have already. As this seems to be an exercise, we won't write the code for you but will advise and guide on your code.