






"""simple docstring"""
def 			lowerCamelCase_    (		_lowerCamelCase     ,  _lowerCamelCase							):
 if len(str(_lowerCamelCase							)							) == 1 or len(str(_lowerCamelCase							)							) == 1:
  return a * b

 lowerCamelCase__	:     int								=		max(len(str(_lowerCamelCase							)							)     ,  len(str(_lowerCamelCase							)							)							)
 lowerCamelCase__	:     Any								=		ma // 2

 lowerCamelCase__							,	lowerCamelCase__	:     Union[str, Any]								=		divmod(_lowerCamelCase     ,  10**ma							)
 lowerCamelCase__							,	lowerCamelCase__	:     Tuple								=		divmod(_lowerCamelCase     ,  10**ma							)

 lowerCamelCase__	:     str								=		karatsuba(_lowerCamelCase     ,  _lowerCamelCase							)
 lowerCamelCase__	:     Optional[Any]								=		karatsuba((aa + aa)     ,  (ba + ba)							)
 lowerCamelCase__	:     str								=		karatsuba(_lowerCamelCase     ,  _lowerCamelCase							)

 return (z * 10 ** (2 * ma)) + ((y - z - x) * 10 ** (ma)) + (x)






def 			lowerCamelCase_    (		):
 print(karatsuba(1_5463     ,  2_3489							)							)


if __name__ == "__main__":
      main()









"""simple docstring"""
class 						a_ :







      '''simple docstring'''

      def __init__(self,	lowerCamelCase_   ):

       '''simple docstring'''



       lowerCamelCase__	:     Dict								=		data
       lowerCamelCase__	:     BinaryTreeNode | None								=		None
       lowerCamelCase__	:     BinaryTreeNode | None								=		None






def 			lowerCamelCase_    (		_lowerCamelCase     ,  _lowerCamelCase							):
 if node is None:
  lowerCamelCase__	:     List[str]								=		BinaryTreeNode(_lowerCamelCase							)
  return node

 # binary search tree is not empty,
 # so we will insert it into the tree
 # if new_value is less than value of data in node,
 #  add it to left subtree and proceed recursively
 if new_value < node.data:
  lowerCamelCase__	:     str								=		insert(node.left_child     ,  _lowerCamelCase							)
 else:
  # if new_value is greater than value of data in node,
  #  add it to right subtree and proceed recursively
  lowerCamelCase__	:     str								=		insert(node.right_child     ,  _lowerCamelCase							)
 return node






def 			lowerCamelCase_    (		_lowerCamelCase							):  # if node is None,return
 if node:
  lowerCamelCase__	:     Any								=		inorder(node.left_child							)
  lowerCamelCase__	:     Tuple								=		[*inorder_array, node.data]
  lowerCamelCase__	:     List[Any]								=		inorder_array + inorder(node.right_child							)
 else:
  lowerCamelCase__	:     Any								=		[]
 return inorder_array






def 			lowerCamelCase_    (		):
 lowerCamelCase__	:     Tuple								=		insert(_lowerCamelCase     ,  15							)
 insert(_lowerCamelCase     ,  10							)
 insert(_lowerCamelCase     ,  25							)
 insert(_lowerCamelCase     ,  6							)
 insert(_lowerCamelCase     ,  14							)
 insert(_lowerCamelCase     ,  20							)
 insert(_lowerCamelCase     ,  60							)
 return root






def 			lowerCamelCase_    (		):
 # main function
 lowerCamelCase__	:     List[Any]								=		make_tree()
 print('Printing values of binary search tree in Inorder Traversal.'							)
 inorder(_lowerCamelCase							)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()

