



from ...configuration_utils import PretrainedConfig
from ...utils import logging


UpperCAmelCase :				List[Any]							=logging.get_logger(__name__)

UpperCAmelCase :				Optional[Any]							={
    """MCG-NJU/videomae-base""": """https://huggingface.co/MCG-NJU/videomae-base/resolve/main/config.json""",
}


class    _lowercase (a_   ):
				'''simple docstring'''







				lowercase__     =    """videomae"""

				def __init__(			self  ,			snake_case__=224  ,			snake_case__=16  ,			snake_case__=3  ,			snake_case__=16  ,			snake_case__=2  ,			snake_case__=768  ,			snake_case__=12  ,			snake_case__=12  ,			snake_case__=3072  ,			snake_case__="gelu"  ,			snake_case__=0.0  ,			snake_case__=0.0  ,			snake_case__=0.02  ,			snake_case__=1e-12  ,			snake_case__=True  ,			snake_case__=True  ,			snake_case__=6  ,			snake_case__=384  ,			snake_case__=4  ,			snake_case__=1536  ,			snake_case__=True  ,			**snake_case__  ,			):

									'''simple docstring'''


									super().__init__(**snake_case__     )

									UpperCamelCase_			= image_size
									UpperCamelCase_			= patch_size
									UpperCamelCase_			= num_channels
									UpperCamelCase_			= num_frames
									UpperCamelCase_			= tubelet_size

									UpperCamelCase_			= hidden_size
									UpperCamelCase_			= num_hidden_layers
									UpperCamelCase_			= num_attention_heads
									UpperCamelCase_			= intermediate_size
									UpperCamelCase_			= hidden_act
									UpperCamelCase_			= hidden_dropout_prob
									UpperCamelCase_			= attention_probs_dropout_prob
									UpperCamelCase_			= initializer_range
									UpperCamelCase_			= layer_norm_eps
									UpperCamelCase_			= qkv_bias
									UpperCamelCase_			= use_mean_pooling

									UpperCamelCase_			= decoder_num_attention_heads
									UpperCamelCase_			= decoder_hidden_size
									UpperCamelCase_			= decoder_num_hidden_layers
									UpperCamelCase_			= decoder_intermediate_size
									UpperCamelCase_			= norm_pix_loss


'''simple docstring'''





class 			UpperCamelCase__	:






 def __init__(      self	:Tuple						,					_A	:int      )					->      None:







       '''simple docstring'''



       __A													=      data
       __A													=      None
       __A													=      None





def 							snake_case				(		UpperCAmelCase   ,	UpperCAmelCase						)->      BinaryTreeNode | None:







      """simple docstring"""
      if node is None:
            __A													=      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:
            __A													=      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
            __A													=      insert(node.right_child   ,	UpperCAmelCase						)
      return node





def 							snake_case				(		UpperCAmelCase						)->      list[int]:  # if node is None,return







      """simple docstring"""
      if node:
            __A													=      inorder(node.left_child						)
            __A													=      [*inorder_array, node.data]
            __A													=      inorder_array + inorder(node.right_child						)
      else:
            __A													=      []
      return inorder_array





def 							snake_case				(		)->      BinaryTreeNode | None:







      """simple docstring"""
      __A													=      insert(UpperCAmelCase   ,	1_5						)
      insert(UpperCAmelCase   ,	1_0						)
      insert(UpperCAmelCase   ,	2_5						)
      insert(UpperCAmelCase   ,	6						)
      insert(UpperCAmelCase   ,	1_4						)
      insert(UpperCAmelCase   ,	2_0						)
      insert(UpperCAmelCase   ,	6_0						)
      return root





def 							snake_case				(		)->      None:







      """simple docstring"""
      # main function
      __A													=      make_tree()
      print('Printing values of binary search tree in Inorder Traversal.'						)
      inorder(UpperCAmelCase						)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()






