code: 
  
  
  
  
  
  
  """simple docstring"""
  
  
  
  
  
  
  from __future__ import annotations
  
  import unittest
  from collections.abc import Iterator
  class 						__lowerCAmelCase   :
  
  
  
  
  
  
  
  		'''simple docstring'''
  
  
  		def __init__(      self:		Union[str, Any]				,			UpperCamelCase_:		int				,			UpperCamelCase_:		Node | None					):
  					UpperCamelCase_     =label
  					UpperCamelCase_     =parent
  					UpperCamelCase_     =None
  					UpperCamelCase_     =None
  
  
  
  
  class 						__lowerCAmelCase   :
  
  
  
  
  
  
  
  		'''simple docstring'''
  
  
  		def __init__(      self:		Any					):
  					UpperCamelCase_     =None
  		def 					UpperCamelCase__   (      self:		int					):
  					UpperCamelCase_     =None
  		def 					UpperCamelCase__   (      self:		List[Any]					):
  					return self.root is None
  		def 					UpperCamelCase__   (      self:		str				,			UpperCamelCase_:		int					):
  					UpperCamelCase_     =self._put(self.root				,			UpperCamelCase_					)
  		def 					UpperCamelCase__   (      self:		Union[str, Any]				,			UpperCamelCase_:		Node | None				,			UpperCamelCase_:		int				,			UpperCamelCase_:		Node | None = None					):
  					if node is None:
  								UpperCamelCase_     =Node(UpperCamelCase_				,			UpperCamelCase_					)
  					else:
  								if label < node.label:
  											UpperCamelCase_     =self._put(node.left				,			UpperCamelCase_				,			UpperCamelCase_					)
  								elif label > node.label:
  											UpperCamelCase_     =self._put(node.right				,			UpperCamelCase_				,			UpperCamelCase_					)
  								else:
  											UpperCamelCase_     =f"""Node with label {label} already exists"""
  											raise Exception(UpperCamelCase_					)
  
  					return node
  		def 					UpperCamelCase__   (      self:		Union[str, Any]				,			UpperCamelCase_:		int					):
  					return self._search(self.root				,			UpperCamelCase_					)
  		def 					UpperCamelCase__   (      self:		Union[str, Any]				,			UpperCamelCase_:		Node | None				,			UpperCamelCase_:		int					):
  					if node is None:
  								UpperCamelCase_     =f"""Node with label {label} does not exist"""
  								raise Exception(UpperCamelCase_					)
  					else:
  								if label < node.label:
  											UpperCamelCase_     =self._search(node.left				,			UpperCamelCase_					)
  								elif label > node.label:
  											UpperCamelCase_     =self._search(node.right				,			UpperCamelCase_					)
  
  					return node
  		def 					UpperCamelCase__   (      self:		int				,			UpperCamelCase_:		int					):
  					UpperCamelCase_     =self.search(UpperCamelCase_					)
  					if node.right and node.left:
  								UpperCamelCase_     =self._get_lowest_node(node.right					)
  								UpperCamelCase_     =node.left
  								UpperCamelCase_     =node.right
  								UpperCamelCase_     =lowest_node
  								if node.right:
  											UpperCamelCase_     =lowest_node
  								self._reassign_nodes(UpperCamelCase_				,			UpperCamelCase_					)
  					elif not node.right and node.left:
  								self._reassign_nodes(UpperCamelCase_				,			node.left					)
  					elif node.right and not node.left:
  								self._reassign_nodes(UpperCamelCase_				,			node.right					)
  					else:
  								self._reassign_nodes(UpperCamelCase_				,			UpperCamelCase_					)
  		def 					UpperCamelCase__   (      self:		Optional[Any]				,			UpperCamelCase_:		Node				,			UpperCamelCase_:		Node | None					):
  					if new_children:
  								UpperCamelCase_     =node.parent
  
  					if node.parent:
  								if node.parent.right == node:
  											UpperCamelCase_     =new_children
  								else:
  											UpperCamelCase_     =new_children
  					else:
  								UpperCamelCase_     =new_children
  		def 					UpperCamelCase__   (      self:		Optional[int]				,			UpperCamelCase_:		Node					):
  					if node.left:
  								UpperCamelCase_     =self._get_lowest_node(node.left					)
  					else:
  								UpperCamelCase_     =node
  								self._reassign_nodes(UpperCamelCase_				,			node.right					)
  
  					return lowest_node
  		def 					UpperCamelCase__   (      self:		List[str]				,			UpperCamelCase_:		int					):
  					try:
  								self.search(UpperCamelCase_					)
  								return True
  					except Exception:
  								return False
  		def 					UpperCamelCase__   (      self:		str					):
  					if self.root is None:
  								raise Exception("Binary search tree is empty"					)
  
  					UpperCamelCase_     =self.root
  					while node.right is not None:
  								UpperCamelCase_     =node.right
  
  					return node.label
  		def 					UpperCamelCase__   (      self:		List[str]					):
  					if self.root is None:
  								raise Exception("Binary search tree is empty"					)
  
  					UpperCamelCase_     =self.root
  					while node.left is not None:
  								UpperCamelCase_     =node.left
  
  					return node.label
  		def 					UpperCamelCase__   (      self:		Optional[Any]					):
  					return self._inorder_traversal(self.root					)
  		def 					UpperCamelCase__   (      self:		List[str]				,			UpperCamelCase_:		Node | None					):
  					if node is not None:
  								yield from self._inorder_traversal(node.left					)
  								yield node
  								yield from self._inorder_traversal(node.right					)
  		def 					UpperCamelCase__   (      self:		str					):
  					return self._preorder_traversal(self.root					)
  
  
  
  
  
  		def 					UpperCamelCase__   (      self:		Union[str, Any]				,			UpperCamelCase_:		Node | None					):
  					if node is not None:
  								yield node
  								yield from self._preorder_traversal(node.left					)
  								yield from self._preorder_traversal(node.right					)
  
  
  
  
  class 						__lowerCAmelCase   (			unittest.TestCase       ):
  
  
  
  
  
  
  
  		'''simple docstring'''
  
  
  		@staticmethod
  		def 					UpperCamelCase__   (      ):
  					UpperCamelCase_     =BinarySearchTree()
  					t.put(8					)
  					t.put(3					)
  					t.put(6					)
  					t.put(1					)
  					t.put(10					)
  					t.put(14					)
  					t.put(13					)
  					t.put(4					)
  					t.put(7					)
  					t.put(5					)
  
  					return t
  		def 					UpperCamelCase__   (      self:		Optional[int]					):
  					UpperCamelCase_     =BinarySearchTree()
  					assert t.is_empty()
  
  					t.put(8					)
  					assert t.root is not None
  					assert t.root.parent is None
  					assert t.root.label == 8
  
  					t.put(10					)
  					assert t.root.right is not None
  					assert t.root.right.parent == t.root
  					assert t.root.right.label == 10
  
  					t.put(3					)
  					assert t.root.left is not None
  					assert t.root.left.parent == t.root
  					assert t.root.left.label == 3
  
  					t.put(6					)
  					assert t.root.left.right is not None
  					assert t.root.left.right.parent == t.root.left
  					assert t.root.left.right.label == 6
  
  					t.put(1					)
  					assert t.root.left.left is not None
  					assert t.root.left.left.parent == t.root.left
  					assert t.root.left.left.label == 1
  
  					with self.assertRaises(UpperCamelCase_					):  # noqa: B017
  								t.put(1					)
  		def 					UpperCamelCase__   (      self:		Optional[int]					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					UpperCamelCase_     =t.search(6					)
  					assert node.label == 6
  
  					UpperCamelCase_     =t.search(13					)
  					assert node.label == 13
  
  					with self.assertRaises(UpperCamelCase_					):  # noqa: B017
  								t.search(2					)
  		def 					UpperCamelCase__   (      self:		str					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					t.remove(13					)
  					assert t.root is not None
  					assert t.root.right is not None
  					assert t.root.right.right is not None
  					assert t.root.right.right.right is None
  					assert t.root.right.right.left is None
  
  					t.remove(7					)
  					assert t.root.left is not None
  					assert t.root.left.right is not None
  					assert t.root.left.right.left is not None
  					assert t.root.left.right.right is None
  					assert t.root.left.right.left.label == 4
  
  					t.remove(6					)
  					assert t.root.left.left is not None
  					assert t.root.left.right.right is not None
  					assert t.root.left.left.label == 1
  					assert t.root.left.right.label == 4
  					assert t.root.left.right.right.label == 5
  					assert t.root.left.right.left is None
  					assert t.root.left.left.parent == t.root.left
  					assert t.root.left.right.parent == t.root.left
  
  					t.remove(3					)
  					assert t.root is not None
  					assert t.root.left.label == 4
  					assert t.root.left.right.label == 5
  					assert t.root.left.left.label == 1
  					assert t.root.left.parent == t.root
  					assert t.root.left.left.parent == t.root.left
  					assert t.root.left.right.parent == t.root.left
  
  					t.remove(4					)
  					assert t.root.left is not None
  					assert t.root.left.left is not None
  					assert t.root.left.label == 5
  					assert t.root.left.right is None
  					assert t.root.left.left.label == 1
  					assert t.root.left.parent == t.root
  					assert t.root.left.left.parent == t.root.left
  		def 					UpperCamelCase__   (      self:		Optional[Any]					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					t.remove(3					)
  					assert t.root is not None
  					assert t.root.left is not None
  					assert t.root.left.left is not None
  					assert t.root.left.right is not None
  					assert t.root.left.right.left is not None
  					assert t.root.left.right.right is not None
  					assert t.root.left.label == 4
  					assert t.root.left.right.label == 6
  					assert t.root.left.left.label == 1
  					assert t.root.left.right.right.label == 7
  					assert t.root.left.right.left.label == 5
  					assert t.root.left.parent == t.root
  					assert t.root.left.right.parent == t.root.left
  					assert t.root.left.left.parent == t.root.left
  					assert t.root.left.right.left.parent == t.root.left.right
  		def 					UpperCamelCase__   (      self:		Optional[Any]					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  					t.empty()
  					assert t.root is None
  		def 					UpperCamelCase__   (      self:		List[str]					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  					assert not t.is_empty()
  
  					t.empty()
  					assert t.is_empty()
  		def 					UpperCamelCase__   (      self:		List[str]					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					assert t.exists(6					)
  					assert not t.exists(-1					)
  		def 					UpperCamelCase__   (      self:		List[Any]					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					assert t.get_max_label() == 14
  
  					t.empty()
  					with self.assertRaises(UpperCamelCase_					):  # noqa: B017
  								t.get_max_label()
  		def 					UpperCamelCase__   (      self:		Optional[int]					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					assert t.get_min_label() == 1
  
  					t.empty()
  					with self.assertRaises(UpperCamelCase_					):  # noqa: B017
  								t.get_min_label()
  		def 					UpperCamelCase__   (      self:		Any					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					UpperCamelCase_     =[i.label for i in t.inorder_traversal()]
  					assert inorder_traversal_nodes == [1, 3, 4, 5, 6, 7, 8, 10, 13, 14]
  
  
  
  
  
  		def 					UpperCamelCase__   (      self:		Dict					):
  					UpperCamelCase_     =self._get_binary_search_tree()
  
  					UpperCamelCase_     =[i.label for i in t.preorder_traversal()]
  					assert preorder_traversal_nodes == [8, 3, 1, 6, 4, 5, 7, 10, 14, 13]
  
  
  
  
  def 						_UpperCamelCase			(  ):
  			UpperCamelCase_     =BinarySearchTree()
  			t.put(8			)
  			t.put(3			)
  			t.put(6			)
  			t.put(1			)
  			t.put(10			)
  			t.put(14			)
  			t.put(13			)
  			t.put(4			)
  			t.put(7			)
  			t.put(5			)
  
  			print(
  			    "\n            8\n           / \\\n          3   10\n         / \\    \\\n        1   6    14\n           / \\   /\n          4   7 13\n           \\\n            5\n        "			)
  
  			print("Label 6 exists:"    ,       t.exists(6			)			)
  			print("Label 13 exists:"    ,       t.exists(13			)			)
  			print("Label -1 exists:"    ,       t.exists(-1			)			)
  			print("Label 12 exists:"    ,       t.exists(12			)			)
  
  			# Prints all the elements of the list in inorder traversal
  			UpperCamelCase_     =[i.label for i in t.inorder_traversal()]
  			print("Inorder traversal:"    ,       A			)
  
  			# Prints all the elements of the list in preorder traversal
  			UpperCamelCase_     =[i.label for i in t.preorder_traversal()]
  			print("Preorder traversal:"    ,       A			)
  
  			print("Max. label:"    ,       t.get_max_label()			)
  			print("Min. label:"    ,       t.get_min_label()			)
  
  			# Delete elements
  			print("\nDeleting elements 13, 10, 8, 3, 6, 14"			)
  			print(
  			    "\n          4\n         / \\\n        1   7\n             \\\n              5\n        "			)
  			t.remove(13			)
  			t.remove(10			)
  			t.remove(8			)
  			t.remove(3			)
  			t.remove(6			)
  			t.remove(14			)
  
  			# Prints all the elements of the list in inorder traversal after delete
  			UpperCamelCase_     =[i.label for i in t.inorder_traversal()]
  			print("Inorder traversal after delete:"    ,       A			)
  
  			# Prints all the elements of the list in preorder traversal after delete
  			UpperCamelCase_     =[i.label for i in t.preorder_traversal()]
  			print("Preorder traversal after delete:"    ,       A			)
  
  			print("Max. label:"    ,       t.get_max_label()			)
  			print("Min. label:"    ,       t.get_min_label()			)
  
  
  if __name__ == "__main__":
  				binary_search_tree_example()
  
style_context: 
  
  
  
  
  
  
  """simple docstring"""
  
  
  
  
  
  
  import unittest
  from dataclasses import dataclass
  from typing import List, Union
  
  import numpy as np
  import PIL.Image
  
  from diffusers.utils.outputs import BaseOutput
  @dataclass
  class 						__lowerCAmelCase   (			UpperCAmelCase       ):
  
  
  
  
  
  
  
    '''simple docstring'''
  
  
    __lowerCamelCase       :    Union[List[PIL.Image.Image], np.ndarray]
  
  
  
  
  class 						__lowerCAmelCase   (			unittest.TestCase       ):
  
  
  
  
  
  
  
    '''simple docstring'''
  
  
    def 					UpperCamelCase__   (      self:		Tuple					):
       UpperCamelCase_     =CustomOutput(images=np.random.rand(1				,			3				,			4				,			4					)					)
  
       # check every way of getting the attribute
       assert isinstance(outputs.images				,			np.ndarray					)
       assert outputs.images.shape == (1, 3, 4, 4)
       assert isinstance(outputs["images"]				,			np.ndarray					)
       assert outputs["images"].shape == (1, 3, 4, 4)
       assert isinstance(outputs[0]				,			np.ndarray					)
       assert outputs[0].shape == (1, 3, 4, 4)
  
       # test with a non-tensor attribute
       UpperCamelCase_     =CustomOutput(images=[PIL.Image.new("RGB"				,			(4, 4)					)]					)
  
       # check every way of getting the attribute
       assert isinstance(outputs.images				,			UpperCamelCase_					)
       assert isinstance(outputs.images[0]				,			PIL.Image.Image					)
       assert isinstance(outputs["images"]				,			UpperCamelCase_					)
       assert isinstance(outputs["images"][0]				,			PIL.Image.Image					)
       assert isinstance(outputs[0]				,			UpperCamelCase_					)
       assert isinstance(outputs[0][0]				,			PIL.Image.Image					)
  
  
  
  
  
    def 					UpperCamelCase__   (      self:		Optional[int]					):
       # test output reinitialization with a `dict` for compatibility with `accelerate`
       UpperCamelCase_     =CustomOutput({"images": np.random.rand(1				,			3				,			4				,			4					)}					)
  
       # check every way of getting the attribute
       assert isinstance(outputs.images				,			np.ndarray					)
       assert outputs.images.shape == (1, 3, 4, 4)
       assert isinstance(outputs["images"]				,			np.ndarray					)
       assert outputs["images"].shape == (1, 3, 4, 4)
       assert isinstance(outputs[0]				,			np.ndarray					)
       assert outputs[0].shape == (1, 3, 4, 4)
  
       # test with a non-tensor attribute
       UpperCamelCase_     =CustomOutput({"images": [PIL.Image.new("RGB"				,			(4, 4)					)]}					)
  
       # check every way of getting the attribute
       assert isinstance(outputs.images				,			UpperCamelCase_					)
       assert isinstance(outputs.images[0]				,			PIL.Image.Image					)
       assert isinstance(outputs["images"]				,			UpperCamelCase_					)
       assert isinstance(outputs["images"][0]				,			PIL.Image.Image					)
       assert isinstance(outputs[0]				,			UpperCamelCase_					)
       assert isinstance(outputs[0][0]				,			PIL.Image.Image					)
  