Circular Singly Linked List | Insertion |  ; Creating a node dynamically ; Assigning the data ; Adjusting the links
static Node addBegin ( Node last , int data ) { if ( last == null ) return addToEmpty ( last , data ) ; Node temp = new Node ( ) ; temp . data = data ; temp . next = last . next ; last . next = temp ; return last ; }