public int idatadata item key public double ddatadata item p

{public int idata;//data item (key) public double ddata;//data item publis link next;//next link in list public link int id double dd)//constructor} idata = id; ddata=dd;} public void display link ()//display ourself {system out. Print (\"{\" + idata + \", \" + ddata + \"}\");}}//end class link class linklist {private link first;//ref to first link on list public link list ()//constructor {first = null;//no links on lists yet public void insertfirst (int id, double dd)//make new link link new link = new link (id, dd); newlink.next = first;//it points to old first link first = newlink;//now first points to this} public link find (int key)//find link with given key {link current = first; while(current.idata ! = key)}//(assumes non-empty list){//starts at first\'//while no match, if (current.next == null)//if end of list return null; else}\'//didnt find it//not end list//not end of list, //go to next link//found it return current;}

Solution

public class Link {

   public int iData;
   public double dData;
   public Link next;

   /**
   * @param iData
   * @param dData
   */
   public Link(int iData, double dData) {
       this.iData = iData;
       this.dData = dData;
   }

   public void displayLink() {

       System.out.println(\"{\" + iData + \", \" + dData + \"} \");
   }

}

public class LinkList {

   private Link first;

   public LinkList() {
       // TODO Auto-generated constructor stub
       first = null;
   }

   public void insertFirst(int id, double dd) {

       Link newLink = new Link(id, dd);

   }

   public Link find(int key) {

       Link current = first;

       while (current.iData != key) {

           if (current.next == null)
               return null;
           else
               current = current.next;
       }
       return current;

   }
}