Implementation single linked list.
package L inked L ist ; class Sll { Node head ; Node tail ; int size ; void length (){ System . out . println ( "length is = " + size ); } void insertAtStart ( int val ){ Node temp = new Node ( val ); if ( head == null ){ head = tail = temp ; size ++ ; return ; } temp . next = head ; head = temp ; size ++ ; } void insertAtEnd ( int val ){ Node temp = new Node ( val ); if ( tail == null ){ head = tail = temp ; size ++ ; return ; } tail . next = temp ; tail = temp ; size ++ ; } ...