LeetCode572：Subtree of Another Tree

Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node's descendants. The tree scould also be considered as a subtree of itself.

Example 1:
Given tree s:

     3
    / \
   4   5
  / \
 1   2

Given tree t:

   4 
  / \
 1   2

Return true, because t has the same structure and node values with a subtree of s.

Example 2:
Given tree s:

     3
    / \
   4   5
  / \
 1   2
    /
   0

Given tree t:

   4
  / \
 1   2

Return false.

---

LeetCode：链接

给定两个非空二叉树s和t，判断t是否是s的子树。s的子树是指由s中某节点及该节点的所有子节点构成的二叉树。

leetcode里空树是空树的子结构，剑指offer里空树不是任意一个树的子结构。

# 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 isSubtree(self, s, t):
        """
        :type s: TreeNode
        :type t: TreeNode
        :rtype: bool
        """
        if not s and not t:
            return True
        if not s or not t:
            return False       
        return self.subTree(s, t) or self.isSubtree(s.left, t) or self.isSubtree(s.right, t)

    def subTree(self, rootA, rootB):
        if not rootA and not rootB:
            return True
        if not rootA or not rootB:
            return False
        if rootA.val != rootB.val:
            return False
        return self.subTree(rootA.left, rootB.left) and self.subTree(rootA.right, rootB.right)