new_contents: """Leetcode 100. Same Tree
  Easy
  
  URL: https://leetcode.com/problems/same-tree/
  
  Given two binary trees, write a function to check if they are the same or not.
  
  Two binary trees are considered the same if they are structurally identical and
  the nodes have the same value.
  
  Example 1:
  Input:     1         1
            / \       / \
           2   3     2   3
          [1,2,3],   [1,2,3]
  Output: true
  
  Example 2:
  Input:     1         1
            /           \
           2             2
          [1,2],     [1,null,2]
  Output: false
  
  Example 3:
  Input:     1         1
            / \       / \
           2   1     1   2
  
          [1,2,1],   [1,1,2]
  Output: false
  """
  
  # Definition for a binary tree node.
  class TreeNode(object):
      def __init__(self, val):
          self.val = val
          self.left = None
          self.right = None
  
  
  class Solution(object):
      def isSameTree(self, p, q):
          """
          :type p: TreeNode
          :type q: TreeNode
          :rtype: bool
          """
          pass
  
  
  def main():
      pass
  
  
  if __name__ == '__main__':
      main()
  
subject: Add lc0100_same_tree.py