Given two binary trees, write a function to check if they are the same or not.<\/p>\n
Two binary trees are considered the same if they are structurally identical and the nodes have the same value.<\/p>\n
Example 1:<\/strong><\/p>\n Example 2:<\/strong><\/p>\n Example 3:<\/strong><\/p>\n Python<\/strong><\/p>\nInput:<\/strong> 1 1\r\n \/ \\ \/ \\\r\n 2 3 2 3\r\n\r\n [1,2,3], [1,2,3]\r\n\r\nOutput:<\/strong> true\r\n<\/pre>\n
Input:<\/strong> 1 1\r\n \/ \\\r\n 2 2\r\n\r\n [1,2], [1,null,2]\r\n\r\nOutput:<\/strong> false\r\n<\/pre>\n
Input:<\/strong> 1 1\r\n \/ \\ \/ \\\r\n 2 1 1 2\r\n\r\n [1,2,1], [1,1,2]\r\n\r\nOutput:<\/strong> false<\/pre>\n
\r\nclass Solution(object):\r\n def isSameTree(self, p, q):\r\n """\r\n :type p: TreeNode\r\n :type q: TreeNode\r\n :rtype: bool\r\n """\r\n if p is None and q is None:\r\n return True\r\n elif p is None or q is None:\r\n return False\r\n if p.val != q.val:\r\n return False\r\n return self.isSameTree(p.right, q.right) and self.isSameTree(p.left, q.left)\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"