(int idx, int data)
| 43 | } |
| 44 | |
| 45 | public void add(int idx, int data) { |
| 46 | if(idx == 0) { |
| 47 | addFirst(data); |
| 48 | return; |
| 49 | } |
| 50 | size++; |
| 51 | Node temp = head; |
| 52 | int i = 0; |
| 53 | while(temp != null) { |
| 54 | if(i == idx-1) {//add here |
| 55 | Node newNode = new Node(data); |
| 56 | //insertion at middle |
| 57 | newNode.next = temp.next; |
| 58 | temp.next = newNode; |
| 59 | return; |
| 60 | } |
| 61 | temp = temp.next; |
| 62 | i++; |
| 63 | } |
| 64 | } |
| 65 | |
| 66 | public int removeFirst() { |
| 67 | if(size == 0) { |
no test coverage detected