




from __future__ import annotations





class 	lowerCamelCase_							:


 '''simple docstring'''







 def __init__(							self  :		Optional[int]    ,    _lowerCAmelCase  :		int						):
       SCREAMING_SNAKE_CASE_     						=      data
       SCREAMING_SNAKE_CASE_     						=      None
       SCREAMING_SNAKE_CASE_     						=      None


def  UpperCAmelCase_							(				__UpperCAmelCase						:     Node | None							) ->			None:  # In Order traversal of the tree
      if tree:
            display(tree.left							)
            print(tree.data							)
            display(tree.right							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     Node | None							) ->			int:
      return 1 + max(depth_of_tree(tree.left							)      ,      depth_of_tree(tree.right							)							) if tree else 0

def  UpperCAmelCase_							(				__UpperCAmelCase						:     Node							) ->			bool:
      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  UpperCAmelCase_							(				) ->			None:  # Main function for testing.
      SCREAMING_SNAKE_CASE_     						=      Node(1							)
      SCREAMING_SNAKE_CASE_     						=      Node(2							)
      SCREAMING_SNAKE_CASE_     						=      Node(3							)
      SCREAMING_SNAKE_CASE_     						=      Node(4							)
      SCREAMING_SNAKE_CASE_     						=      Node(5							)
      SCREAMING_SNAKE_CASE_     						=      Node(6							)
      SCREAMING_SNAKE_CASE_     						=      Node(7							)
      SCREAMING_SNAKE_CASE_     						=      Node(8							)
      SCREAMING_SNAKE_CASE_     						=      Node(9							)

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


if __name__ == "__main__":
   main()





def  UpperCAmelCase_							(				__UpperCAmelCase						:     str							) ->			str:
      SCREAMING_SNAKE_CASE_     						=      ''
      for ch in key:
            if ch == " " or ch not in key_no_dups and ch.isalpha():
                  key_no_dups += ch
      return key_no_dups

def  UpperCAmelCase_							(				__UpperCAmelCase						:     str							) ->			dict[str, str]:
      SCREAMING_SNAKE_CASE_     						=      [chr(i + 65							) for i in range(26							)]
      # Remove duplicate characters from key
      SCREAMING_SNAKE_CASE_     						=      remove_duplicates(key.upper()							)
      SCREAMING_SNAKE_CASE_     						=      len(__UpperCAmelCase							)
      # First fill cipher with key characters
      SCREAMING_SNAKE_CASE_     						=      {alphabet[i]: char for i, char in enumerate(__UpperCAmelCase							)}
      # Then map remaining characters in alphabet to
      # the alphabet from the beginning
      for i in range(len(__UpperCAmelCase							)      ,      26							):
            SCREAMING_SNAKE_CASE_     						=      alphabet[i - offset]
            # Ensure we are not mapping letters to letters previously mapped
            while char in key:
                  offset -= 1
                  SCREAMING_SNAKE_CASE_     						=      alphabet[i - offset]
            SCREAMING_SNAKE_CASE_     						=      char
      return cipher_alphabet

def  UpperCAmelCase_							(				__UpperCAmelCase						:     str      ,      __UpperCAmelCase						:     dict[str, str]							) ->			str:
      return "".join(cipher_map.get(__UpperCAmelCase      ,      __UpperCAmelCase							) for ch in message.upper()							)

def  UpperCAmelCase_							(				__UpperCAmelCase						:     str      ,      __UpperCAmelCase						:     dict[str, str]							) ->			str:
      SCREAMING_SNAKE_CASE_     						=      {v: k for k, v in cipher_map.items()}
      return "".join(rev_cipher_map.get(__UpperCAmelCase      ,      __UpperCAmelCase							) for ch in message.upper()							)

def  UpperCAmelCase_							(				) ->			None:
      SCREAMING_SNAKE_CASE_     						=      input('Enter message to encode or decode: '							).strip()
      SCREAMING_SNAKE_CASE_     						=      input('Enter keyword: '							).strip()
      SCREAMING_SNAKE_CASE_     						=      input('Encipher or decipher? E/D:'							).strip()[0].lower()
      try:
            SCREAMING_SNAKE_CASE_     						=      {'e': encipher, 'd': decipher}[option]
      except KeyError:
            raise KeyError('invalid input option'							)
      SCREAMING_SNAKE_CASE_     						=      create_cipher_map(__UpperCAmelCase							)
      print(func(__UpperCAmelCase      ,      __UpperCAmelCase							)							)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   main()