Briefly describe what each of the following recursive methods does on a chain of nodes.
Do not just redescribe the code. Instead, briefly state what each method does at a high level. Assume that a reference to the head node containing data is passed to each method below.
A) public static boolean methodA(Listnode curr) { if (curr == null) return true; if (curr.getNext() == null) return true; return curr.getData() > curr.getNext().getData() && methodA(curr.getNext()); }
B) public static int methodB(Listnode curr, E x) { if (curr == null) return 0; if (x.equals(curr.getData())) return 1 + methodB(curr.getNext(), x); return methodB(curr.getNext(), x); } head = methodC(head, x); //initial methodC call
C) public static Listnode methodC(Listnode curr, Integer x) { if (curr == null) return null; if (curr.getData() == x) return methodC(curr.getNext(), x); curr.setNext(methodC(curr.getNext(), x)); return curr; }