(int data)
| 16 | |
| 17 | //add |
| 18 | public void addFirst(int data) { |
| 19 | Node newNode = new Node(data); |
| 20 | size++; |
| 21 | if(head == null) { |
| 22 | head = tail = newNode; |
| 23 | return; |
| 24 | } |
| 25 | |
| 26 | newNode.next = head; |
| 27 | head.prev = newNode; |
| 28 | head = newNode; |
| 29 | } |
| 30 | |
| 31 | |
| 32 | public void print() { |