Question

This problem concerns creating a function String secondInOrder (Node start) which takes a linked list of Node elements (shown below), and returns the String in the list which comes second in alphabetic order. Recall that the String class has the method public int compareTo(String anotherString) which returns O if the strings are equal, a negative integer if this is earlier than anotherString and a positive integer otherwise. You may assume the list has at least two elements. See the illustrations below for examples: Given a list with these elements: "a""b" "c" secondInOrder(start) returns "b" Given a list with these elements: "this" "is" "a" "very""long" "list" secondInOrder(start) returns "is" Given a list with these elements: "this" "is" "shorter", secondinOrder(start) returns "shorter" Given a list with these elements: "a""long" "list", secondinOrder(start) returns "list" class Node { String data; Node next;

b) Write the function as Java code, including comments as you see fit.

Answer 1

ANSWER:-

CODE:-

import java.util.*;  
class Node{
   String data;
   Node next;
   Node(String data){
       this.data = data;
       this.next = null;
   }
}
class SecondInOrder{
   public void insert(Node start, String data){
       // inserts a node at the
       // end of linked list
       Node newNode = new Node(data);
       if(start == null)
           start = newNode;
       else{
           Node ptr = start;
           while(ptr.next != null){
               ptr = ptr.next;
           }
           ptr.next = newNode;
       }
   }
   public String secondInOrder(Node start){
       Node ptr = start;
       // create a list
       List<String> list = new ArrayList<>();
       // insert every string in linkedlist
       while(ptr!=null){
           list.add(ptr.data);
           ptr = ptr.next;
       }
       // sort the list
       Collections.sort(list);
       // return second element in the list
       return list.get(1);
   }
   public static void main(String[] args) {
       SecondInOrder obj = new SecondInOrder();
       Node start = new Node("this");
       obj.insert(start, "is");
       obj.insert(start, "a");
       obj.insert(start, "very");
       obj.insert(start, "long");
       obj.insert(start, "list");
       System.out.println(obj.secondInOrder(start));
   }
}

NOTE:- If you need any modifications in the code,please comment below.Please give positive rating.THUMBS UP.

             THANK YOU!!!!

OUTPUT:-

is