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 [ ] '
int findClosestUtil ( struct Node * root , char k , struct Node * ancestors [ ] , int index ) {