Returns distance of the cloest leaf to a given key ' k ' . The array ancestors is used to keep track of ancestors of current node and ' index ' is used to keep track of curremt index in ' ancestors [ ] '
public virtual int findClosestUtil ( Node node , char k , Node [ ] ancestors , int index ) {