Question

#1. Single linked list - find...

Extra info/hint? It's free For this problem, I have a complete linked list program which supports the following commands from the user: insert, display, delete, average, find, insertBefore, insertAfter. insert allows them to insert a number into the current list, display will display the numbers in the current list etc. The program is complete except that I have removed the body of the method for find. Given the following class for the nodes in a linked list: public class Node { ... public Node getNext() {...} // return next field public int getData() {...} // returns data } Assuming that the variable head points to (i.e. contains the address of) the first node of a linked list, write the statements to find the first occurrence of the data value x in the linked list. For example, find(4) would return something like "Found at node position 20" or "Not found" Assume that the nodes in the linked list are counted starting from 1. Your statements will be inserted inside a method like the following: public String find(int x) { // Whatever statements you provide in response to this question will // be inserted here BY THE SYSTEM and then compiled and tested as part of // a larger program which does many other things with the linked list } Sample console I/O execution sequence Linked list code sample. Options are: (insert, display, delete, average, find, insertBefore, insertAfter) What would you like: Find 4 Not found What would you like: insert 10 inserted 10 What would you like: insert 30 inserted 30 What would you like: Find 30 Found at node position 1 What would you like: Find 10 Found at node position 2 What would you like: Exit Bye

2. Single linked list - average...

Extra info/hint? It's free For this problem, I have a complete linked list program which supports the following commands from the user: insert, display, delete, average, find, insertBefore, insertAfter. insert allows them to insert a number into the current list, display will display the numbers in the current list etc. The program is complete except that I have removed the body of the method for averaging the numbers in the linked list.. Given the following class for the nodes in a linked list: public class Node { ... public Node getNext() {...} // return next field public int getData() {...} // returns data } Assuming that the variable head points to (i.e. contains the address of) the first node of a linked list, write the statements to find the average of all data values in the linked list. For example, average() will return something like "avg: 2.67" or "Empty". The average should be returned as a string with exactly two digits of decimal accuracy, or Empty if the list is empty. Your statements will be inserted inside a method like the following: public String average() { // Whatever statements you provide in response to this question will // be inserted here BY THE SYSTEM and then compiled and tested as part of // a larger program which does many other things with the linked list } Sample console I/O execution sequence Linked list code sample. Options are: (insert, display, delete, average, find, insertBefore, insertAfter) What would you like: insert 4 inserted 4 What would you like: insert 1 inserted 1 What would you like: insert 3 inserted 3 What would you like: average avg: 2.67 What would you like: delete 3 deleted 3 What would you like: delete 4 deleted 4 What would you like: delete 1 deleted 1 What would you like: average Empty What would you like: Exit Bye

Answer 1

public String find(int x) 
        { 
      String s1 = "Not found";
      String s2 ="found at Node position ";
      int pos=1;  //It is current position of visiting node.
                Node current = head; //Initialize current node where head refers first node of linked list
                while (current != null) 
                { 
                        if (current.data == x) {  //data found 
                          s2 += pos;
                          return s2; 
                        }
                        pos++;
                        current = current.next; 
                } 
       
                return s1; //data not found 
        } 

1. Make class object for accessing above function-

LinkedList list = new LinkedList();

int number = 10; //data which u want to find in the linked list.

2. For successfully returned output we will have to call above function inside the main function and store return value of find() function into new string variable like below-

String result = list.find(number);

System.out.println(result); //It shows the result according to node availability inside your linked list.