If key node found , store current node and recur for left and right childrens
ancestors [ index ] = root ; return getMin ( findClosestUtil ( root -> left , k , ancestors , index + 1 ) , findClosestUtil ( root -> right , k , ancestors , index + 1 ) ) ; }