Question

Java Question:

Can you guys please help me write below code in RECURSION.

// add a key-value pair, replacing old key-value pair if key is already present
   public void put(K key, V val) {
       if (val == null) { delete(key); return; }
       for (Node<K,V> x = first; x != null; x = x.next)
           if (key.equals(x.key)) { x.val = val; return; }
       first = new Node<>(key, val, first);
       N++;
   }

Answer 1

public void put(K key, V val) {
    if (val == null) { delete(key); return; }
    if(first == null){
        first = new Node<>(key, val, first);
        N++;
    }
    else if (key.equals(first.key)) { 
        first.val = val;
        return;  
    }
    else{
        first=first.next;
        put(K, V);
    }
}