def findSmallest(root):
 if (root.left is None):
  return root
 else:
  return findSmallest(root.left)

def findSmallest ( root ) : if ( root . left is None ) : return root else : return findSmallest ( root . left )
finds the smallest node in the subtree .