Question

This exam is closed book. Write your name on every page. Write your solutions in the space provided. If you need more space, attach a sheet and staple to your exam. Do not spend too much time on any problem. Show your work, as partial credit will be given. You will be graded not only on he correctness and efficiency of your answers, but also on your clarity. Be neat. public class Node public int icem,: publie Node next: Node ) // this vould be the default, put here for reterence item- 0: next-null: Node (int n) item- next -null; Node (int n, Node p) item n: next P: We will assume that there is a variable which points to the head of the list: Node head: a. Write a recursive method in Java, assuming the above declaration, to compute the sum of all the values in the nodes of a singly linked list. 1. b. Write a recursive function in Java, assuming the declaration above,to find the length of t of the list

Answer 1

// a
public int sum(Node n) {
    if (n == null) {
        return 0;
    } else {
        return sum(n.next) + n.item;
    }
}

// b
public int length(Node n) {
    if (n == null) {
        return 0;
    } else {
        return length(n.next) + 1;
    }
}