Name:......................................................................... Student No:...................................

Important: Write clearly. If necessary write out a neat and formatted version of your code separate from your rough-work.

Problem 11.1 Write a method for an ordered binary tree that returns the contents of the leaf node with the highest value.

Problem 11.2 A class to implement a hash table of student id.s is required. The student id. (the key) is stored as type verylongint and each student's name and address are stored as character strings. Write a suitable hash() method, search() method, and constructor for the hash table that takes the size of the table as a parameter.

End of Lab Sheet