Consider the following two classes Node and CircularlyLinkedList: private class Node { private int element; private...

 

Transcribed Image Text:

Consider the following two classes Node and CircularlyLinkedList: private class Node { private int element; private Node next; public Node (int e, Node n) { element = e; next = n; } public int getElement() public Node getNext() } { return element; } return next; } { public void setNext (Node n) { next = n; } public class CircularlyLinkedList { private Node tail = null; } private int size = 0; Add the method count Element () that count the number of nodes whose value is greater than the average value of all elements in the list to the CircularlyLinkedList class. Consider the following two classes Node and CircularlyLinkedList: private class Node { private int element; private Node next; public Node (int e, Node n) { element = e; next = n; } public int getElement() public Node getNext() } { return element; } return next; } { public void setNext (Node n) { next = n; } public class CircularlyLinkedList { private Node tail = null; } private int size = 0; Add the method count Element () that count the number of nodes whose value is greater than the average value of all elements in the list to the CircularlyLinkedList class.