{}
CODE VISUALIZER
Master DSA, Python and C with step-by-step code visualization.
See it in action
CODE VISUALIZER
Master DSA, Python and C with step-by-step code visualization.
See it in action
run-icon
Main.java
import java.util.Scanner; 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); } int GetLeftMiddle(){ Node temp=head; int len=0; while(temp!=null){ temp=temp.next; len++; } temp=head; int mid=len/2; for(int i=1; i<=mid-1; i++){ temp=temp.next; } return temp.val; } } public class Implement { public static void main(String[] args) { Scanner sc =new Scanner(System.in); Sll list = new Sll(); list.insertAtEnd(5); list.insertAtEnd(6); list.insertAtEnd(7); list.insertAtEnd(8); list.display(); System.out.print("the value is= "+list.GetLeftMiddle()); } }
Output