Doubly Linked List | Set 1 ( Introduction and Insertion ) | Add a node at the end of the list ; 1. allocate node * 2. put in the data ; 3. This new node is going to be the last node , so * make next of it as NULL ; 4. If the Linked List is empty , then make the new * node as head ; 5. Else traverse till the last node ; 6. Change the next of last node ; 7. Make last node as previous of new node
void append ( int new_data ) { Node new_node = new Node ( new_data ) ; Node last = head ; new_node . next = null ; if ( head == null ) { new_node . prev = null ; head = new_node ; return ; } while ( last . next != null ) last = last . next ; last . next = new_node ; new_node . prev = last ; }