Recursively traverse HashMap?

Question

Is there a way to recursively traverse a HashMap so that value1 of key1 is actually the new key2 which returns value2 that again will be the next key3 and so on ... till it returns null? The logic is as follows:

hm.get(key)
hm.get(hm.get(key))
hm.get(hm.get(hm.get(key)))
......

I'm assuming this may be done through some recursion procedure? Please correct me if I were wrong. Thanks!

Answer 1

Is this the one you wanted procedure? it will return the ultimate value by traversing the hashmap:

 Public Object traverseMap(Object key)
    while(hm.get(key) != null){
      key = hm.get(key);
    }
    return key;
 }