implementation of link list
implementation of link list import java.util.Scanner; class Node{ public int data;//data public Node next;//next Node()//constructor { data=0; next=null; } Node(int data,Node next)//constructor { this.data=data; this.next=next; } //set data public void setData(int val) { data=val; } public Node setNext(Node n) {return next=n;} public int getData() {int val=data;return val;} public Node getNext() { return next;} public String toString() { return "data="+data; } }//end of node //class link list class LinkList{ public Node start; //starting node for reference public int size; //size of link list. LinkList(){start=null;size=0;} //empty public boolean isEmpty() { return start==null; } //size public int getSize() { return size; } //3 view list public void viewList() { Node temp; if(isEmpty()) { System.out.println("List is empty."); } else { temp=start; for(int i=1;i<=size;i++) { System.out.println(temp.g...
Comments
Post a Comment