(Node node)
| 44 | |
| 45 | // remove node from list |
| 46 | public void remove(Node node) { |
| 47 | Node prev = node.prev; |
| 48 | Node next = node.next; |
| 49 | |
| 50 | prev.next = next; |
| 51 | next.prev = prev; |
| 52 | } |
| 53 | |
| 54 | // insert node at right |
| 55 | public void insert(Node node) { |
no outgoing calls
no test coverage detected