





'''simple docstring'''



from __future__ import annotations






class 							__lowercase    :







	'''simple docstring'''

	def __init__(self       ,_lowerCamelCase	)							->							None:







				'''simple docstring'''





				__lowercase			  =							data
				__lowercase			  =							None
				__lowercase			  =							None





def 				_lowerCAmelCase  (			lowerCamelCase_     :					Node | None			):  # In Order traversal of the tree
			if tree:
						display(tree.left			)
						print(tree.data			)
						display(tree.right			)




def 				_lowerCAmelCase  (			lowerCamelCase_     :					Node | None			):
			return 1 + max(depth_of_tree(tree.left			)						,    depth_of_tree(tree.right			)			) if tree else 0




def 				_lowerCAmelCase  (			lowerCamelCase_     :					Node			):
			if not tree:
						return True
			if tree.left and tree.right:
						return is_full_binary_tree(tree.left			) and is_full_binary_tree(tree.right			)
			else:
						return not tree.left and not tree.right




def 				_lowerCAmelCase  (			):  # Main function for testing.
			__lowercase			  =							Node(1			)
			__lowercase			  =							Node(2			)
			__lowercase			  =							Node(3			)
			__lowercase			  =							Node(4			)
			__lowercase			  =							Node(5			)
			__lowercase			  =							Node(6			)
			__lowercase			  =							Node(7			)
			__lowercase			  =							Node(8			)
			__lowercase			  =							Node(9			)

			print(is_full_binary_tree(lowerCamelCase_			)			)
			print(depth_of_tree(lowerCamelCase_			)			)
			print('''Tree is: '''			)
			display(lowerCamelCase_			)


if __name__ == "__main__":
	main()












'''simple docstring'''



import numpy as np




def 				_lowerCAmelCase  (			lowerCamelCase_     :					np.array			):
			return 1 / (1 + np.exp(-vector			))




def 				_lowerCAmelCase  (			lowerCamelCase_     :					np.array			):
			return vector * sigmoid(1.7_02 * vector			)


if __name__ == "__main__":
	import doctest

	doctest.testmod()





