linkedlist
class SLL { private Node head ; private Node tail ; private int size ; void deleteAtIndex ( int ix ){ if ( ix < 0 || ix >= size ){ throw new IndexOutOfBoundsException ( "bhai wrong index mat dal" ); } if ( ix == 0 ){ deleteAtStart (); return ; } if ( ix == size - 1 ){ deleteAtEnd (); return ; } Node x = head ; for ( int i = 0 ; i < ix - 1 ; i ++ ){ x = x . next ; } x . next = x . next . next ; size -- ; } void deleteAtEnd (){ if ( tail == null ){ System . out . println ( "list is already empty" ...