class TreeNode(object):
def __init__(self, value):
    self.left = None
    self.right = None
    self.data = value

def checkRowOnTree(tree, M):
  if tree is None:
      return False
  n = len(M)
  m = len(M[0])
  flag = []
  for i in range(n):
      for j in range(m):
          if tree is not None:
              return(tree.data == (M[i][j]) and   checkRowOnTree(tree.left, M) and checkRowOnTree(tree.right, M))