我怎样才能改变这段代码，使我只有getKey？

Question

private void searchForK(V value , DictionaryNode<K,V> node){ 
     if(node != null){ 
      if(((Comparable<V>)value).compareTo(node.value) == 0) { 
       obtainKey = node.key; 
       return; 
      } 
      searchForK(value,node.lChild); //recursive since we have to simply look 
      searchForK(value,node.rChild);//through each child which is itself another searchforK 
     }  
    } 

public K getKey(V value) { 
    searchForK(value,rNode); 
    return obtainKey; 

}//end getKey 

如何将上述代码更改为getKey的函数？我对递归感到困惑。我想摆脱searchForK函数，并让getKey具有与searchForK相同的功能。

这是我在改变两个功能的尝试：

public K getKey(V value) { 
     // private void searchForK(V value , DictionaryNode<K,V> node){ 
     if(rNode != null){ 
      if(((Comparable<V>)value).compareTo(rNode.value) == 0) { 
       obtainKey = rNode.key; 
       return (K) obtainKey; 
      } 
       rNode = rNode.lChild; 
       getKey(value); 
       rNode = rNode.rChild; 
       getKey(value); 
      } 
     return null; 

它不行为相同的方式，虽然，我究竟做错了什么？

这些都是我的全局变量：

public class BinarySearchTree<K,V> implements DictionaryADT<K,V> { 
    /* data fields */ 

    /* Node Variables */ 
    public DictionaryNode<K,V> rNode; //Root Node 
    public DictionaryNode<K,V> pNode; //Parent Node 
    K obtainKey; 

我是否应该更换rNode是CURNODE在我的情况？

Answer 1

private DictionaryNode<K,V> curNode = rNode; 

public K getKey(V value) { 

    if (curNode != null) { 
     int c = ((Comparable<V>)curNode.value).compareTo(value); 

     if (c == 0) { 

       K key = curNode.key; 

       curNode = rNode; // reset curNode 
       return key; 
     } 
     else if (c < 0 && curNode.lChild != null) { 
       curNode = curNode.lChild; 
       return getKey(value); 
     } 
     else if (curNode.rChild != null) { 
       curNode = curNode.rChild; 
       return getKey(value); 
     } 
    } 
    curNode = rNode; // reset curNode 
    return null; 

}