Question

write a c++ function which finds and returns the smallest node in binary search tree using recursion

Answer 1

node* getSmallest(node* n) 
{        
  if (n == NULL)
    return NULL;        
  else if (n -> left == NULL)            
    return n;        
  else            
    return getSmallest(n -> left);    
}