SinglyLinkedList Operations
import java.util.*; import java.lang.*; import java.io.*; class SinglyLinkedList { private static Node head; private static void create(int[] data) { // create first Node head = new Node(data[0], null); // if only single element if(data.length == 1) { return; } Node last = head; for(int i = 1; i max) { max = temp.getData(); } // move next node temp = temp.getNext(); } return max; } private static int maxRecursive(Node head) { if(head == null) { return Integer.MIN_VALUE; } int max = maxRecursive(head.getNext()); return max > head.getData() ? max : head.getData(); } private static int min() { if(head == null) { return 0; } Node temp = head; int min = Integer.MAX_VALUE; while(temp != null) { if(temp.getData() curr...