()
| 38 | } |
| 39 | |
| 40 | public int removeFirst() { |
| 41 | if(head == null) { |
| 42 | return Integer.MIN_VALUE; |
| 43 | } |
| 44 | size--; |
| 45 | if(head == tail) { |
| 46 | int val = head.data; |
| 47 | head = tail = null; |
| 48 | return val; |
| 49 | } |
| 50 | int val = head.data; |
| 51 | head = head.next; |
| 52 | head.prev = null; |
| 53 | return val; |
| 54 | } |
| 55 | |
| 56 | public void reverse() { |
| 57 | Node curr = head; |