



def 			a		( _UpperCAmelCase				:   str		):







		'''simple docstring'''





		__UpperCAmelCase       :	Optional[Any]						=      0
		for letter in data:
				__UpperCAmelCase       :	Union[str, Any]						=      (hash_ << 4) + ord(_UpperCAmelCase		)
				__UpperCAmelCase       :	Optional[Any]						=      hash_ & 0xF000_0000
				if x != 0:
						hash_ ^= x >> 24
				hash_ &= ~x
		return hash_


if __name__ == "__main__":
				import doctest

				doctest.testmod()










class 						UpperCAmelCase__     :




			'''simple docstring'''






			def __init__(  self				:					List[Any]			,			a_				:					int					):
					'''simple docstring'''





					__UpperCAmelCase       :	List[Any]						=      data
					__UpperCAmelCase       :	BinaryTreeNode | None						=      None
					__UpperCAmelCase       :	BinaryTreeNode | None						=      None

def 			a		( _UpperCAmelCase				:   BinaryTreeNode | None					,  _UpperCAmelCase				:   int		):







		'''simple docstring'''





		if node is None:
				__UpperCAmelCase       :	List[Any]						=      BinaryTreeNode(_UpperCAmelCase		)
				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:
				__UpperCAmelCase       :	int						=      insert(node.left_child					,  _UpperCAmelCase		)
		else:
				# if new_value is greater than value of data in node,
				#  add it to right subtree and proceed recursively
				__UpperCAmelCase       :	str						=      insert(node.right_child					,  _UpperCAmelCase		)
		return node

def 			a		( _UpperCAmelCase				:   None | BinaryTreeNode		):  # if node is None,return







		'''simple docstring'''





		if node:
				__UpperCAmelCase       :	Optional[int]						=      inorder(node.left_child		)
				__UpperCAmelCase       :	int						=      [*inorder_array, node.data]
				__UpperCAmelCase       :	Optional[Any]						=      inorder_array + inorder(node.right_child		)
		else:
				__UpperCAmelCase       :	List[Any]						=      []
		return inorder_array

def 			a		( ):







		'''simple docstring'''





		__UpperCAmelCase       :	Any						=      insert(_UpperCAmelCase					,  15		)
		insert(_UpperCAmelCase					,  10		)
		insert(_UpperCAmelCase					,  25		)
		insert(_UpperCAmelCase					,  6		)
		insert(_UpperCAmelCase					,  14		)
		insert(_UpperCAmelCase					,  20		)
		insert(_UpperCAmelCase					,  60		)
		return root

def 			a		( ):







		'''simple docstring'''





		__UpperCAmelCase       :	List[Any]						=      make_tree()
		print('''Printing values of binary search tree in Inorder Traversal.'''		)
		inorder(_UpperCAmelCase		)


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				main()





