# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def isSameTree(self, p, q):
        """
        :type p: TreeNode
        :type q: TreeNode
        :rtype: bool
        """
 

        if p==None and q!=None:
            return False
        if p!=None and q==None:
            return False
        if p!=None and q!=None:
            if(p.val!=q.val):
                return False
            else:
                if self.isSameTree(p.right,q.right) ==False:
                    return
 
 False
                if self.isSameTree(p.left,q.left) ==False:
                    return False
        return True      

class Solution(object):
    def merge(self, nums1, m, nums2, n):
        """
        :type nums1: List[int]
        :type m: int
        :type nums2: List[int]
        :type n: int
        :rtype: void Do not return anything, modify nums1 in-place instead.
        """
 

        j=0
        zzz=m+n
        for i,x in enumerate(nums1):
           if j>n-1:
               break
           if(x)== 0:
               nums1.insert(i,nums2[j])
               j+=1
               continue
           if(x>=nums2[j]):
               nums1.insert(i, nums2[j])
               j+=1
        nums1=nums1[:1]