Java Programming:

P4 (5 points) Give an efficient algorithm for finding the second largest integer in a binary search tree t. P5 (10 points) L1 and L2 are two non-null linked lists with the expected methods and fields. Write code that creates a simple linked list ( uses objects of the ListNode class) L, which contains the integers that are in both L1 and L2. As an example, for the lists below, L should contain 3, 8, and 6. Both L1 and L2 do not contain any integer more than once. LI: 3 8 14 6 ?2:73690 2 8 9 10 19 4 15