{}
class Node{
int val;
Node next;
Node(int val){
this.val=val;
}
}
class Sll{
Node head;
Node tail;
int size;
void insertAtEnd(int val){
Node temp = new Node(val);
if(head==null) head=tail=temp;
else
{
tail.next=temp;
tail=temp;
}
size++;
}
void display(){
Node temp=head;
while(temp!=null) {
System.out.print(temp.val+" ");
temp=temp.next;
}
System.out.println();
}
void size(){
System.out.println("size is= "+size);
}
void deleteAtEnd()throws Error{
if(tail==null){
throw new Error("already empty linked list");
}
if(head==tail){
head=tail=null;
return;
}
Node temp=head;
while(temp.next!=tail){
temp=temp.next;
}
temp.next=null;
tail=temp;
size--;
}
}
public class Implement {
public static void main(String[] args) {
Sll list = new Sll();
list.insertAtEnd(5);
list.insertAtEnd(6);
list.insertAtEnd(7);
list.insertAtEnd(8);
list.display();
System.out.println("after delete linked list=");
list.deleteAtEnd();
list.display();
}
}