Question

how to implement a linked list object using only singly linked list toolkit. Then implement a FREQUENCY function to count the ovcurrence of each element in the list.

task#1:

Add = operator to node:

implement the assignment operator for the node such that setting a node = overwrites the value in the node with the value.

task#2:Linked List class

implement the methods of linked list.

insert

search and locate

remove

node* operator []

task#3: Implement the Frequency

Answer 1

class LinkedListMy {

   private static int value_count;
   private Node head;

   // Default constructor
   public LinkedListMy() {

   }

   // appends at last of the list.
   public void add(Object your_values) {

       // incase of 1st element initiliz node
       if (head == null) {
           head = new Node(your_values);
       }

       Node temp_variable = new Node(your_values);
       Node current_val = head;

      
       if (current_val != null) {

           // iterate and then add element after last
           while (current_val.getnext_point() != null) {
               current_val = current_val.getnext_point();
           }

          
           current_val.setnext_point(temp_variable);
       }

       //update number of element in the list
       incrementvalue_count();
   }

   private static int getvalue_count() {
       return value_count;
   }

   private static void incrementvalue_count() {
       value_count++;
   }

   public Object get(int index)
   // to retreive element on the basis of position.
   {
       if (index < 0)
           return null;
       Node current_val = null;
       if (head != null) {
           current_val = head.getnext_point();
           for (int i = 0; i < index; i++) {
               if (current_val.getnext_point() == null)
                   return null;

               current_val = current_val.getnext_point();
           }
           return current_val.getyour_values();
       }
       return current_val;

   }

   // total size of list.
   public int size() {
       return getvalue_count();
   }

   private class Node {
       Object your_values;
       Node next_point;

       // Node constructor
       public Node(Object your_valuesValue) {
           next_point = null;
           your_values = your_valuesValue;
       }
   
       @SuppressWarnings("unused")
       public Node(Object your_valuesValue, Node next_pointValue) {
           next_point = next_pointValue;
           your_values = your_valuesValue;
       }
       public Node getnext_point() {
           return next_point;
       }

       public void setnext_point(Node next_pointValue) {
           next_point = next_pointValue;
       }
      
       public Object getyour_values() {
           return your_values;
       }

       @SuppressWarnings("unused")
       public void setyour_values(Object your_valuesValue) {
           your_values = your_valuesValue;
       }

   }
}