input: Write a python function to create a binary tree with a maximum depth and return a random binary tree.
  assert isinstance(create_tree(0), int) and create_tree(0) in [0, 1]
  assert isinstance(create_tree(1), (tuple, int))
  assert isinstance(create_tree(2), (tuple, int))
output: import random
  
  def create_tree(max_depth):
      if max_depth == 0:
          return random.randint(0, 1)
      if max_depth == 1:
          return (random.randint(0, 1), random.randint(0, 1), random.randint(0, 1))
      left_subtree = create_tree(max_depth - 1)
      right_subtree = create_tree(max_depth - 1)
      return (random.randint(0, 1), left_subtree, right_subtree)