input: 
  def is_subtree(tree_one: Node, tree_two: Node) -> bool:
      """
      Check if the first binary tree is a subtree of the second binary tree.
  
      >>> tree1 = Node(1)
      >>> tree1.left = Node(2)
      >>> tree1.right = Node(3)
      >>> tree2 = Node(4)
      >>> tree2.left = Node(1)
      >>> tree2.left.left = Node(2)
      >>> tree2.left.right = Node(3)
      >>> is_subtree(tree1, tree2)
      False
      >>> tree2.right = Node(1)
      >>> tree2.right.left = Node(2)
      >>> tree2.right.right = Node(3)
      >>> is_subtree(tree1, tree2)
      True
      """
  
output:     if tree_one is None:
          return True
      if tree_two is None:
          return False
      
      def is_identical(node1, node2):
          if node1 is None and node2 is None:
              return True
          if node1 is None or node2 is None:
              return False
          return (node1.value == node2.value and
                  is_identical(node1.left, node2.left) and
                  is_identical(node1.right, node2.right))
      
      def find_subtree(node1, node2):
          if node1 is None:
              return False
          if is_identical(node1, node2):
              return True
          return find_subtree(node1.left, node2) or find_subtree(node1.right, node2)
      
      return find_subtree(tree_two, tree_one)