Suppose that there is a long queue of people. The number of people is not known. You have to use a data structure that enables you to store the height of all people. Find the height of the tallest...

Extracted text: Suppose that there is a long queue of people. The number of people is not known. You have to use a data structure that enables you to store the height of all people. Find the height of the tallest person from the data structure. Solve the problem separately using both Linked-list and binary search tree. Explain which data structure requires less time complexity.Note[You can not use any building function ,you have to use java as you language]