[leetcode: Python]572. 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 s could 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.
方法一：445ms

# 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 check(self, s, t):
        if s is None or t is None:
            return s is None and t is None
        if s.val != t.val:
            return False
        return self.check(s.left, t.left) and self.check(s.right, t.right)
    def isSubtree(self, s, t):
        """
        :type s: TreeNode
        :type t: TreeNode
        :rtype: bool
        """
        if s is None or t is None:
            return s is None and t is None
        if self.check(s, t):
            return True
        return self.isSubtree(s.left, t) or self.isSubtree(s.right, t)

方法二：156ms

# 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
        """
        
        def preorder(node):
            if not node:
                return "$"
            return "^" + str(node.val) + "#" + preorder(node.left) + preorder(node.right)
        print preorder(s)
        print preorder(t)
        return preorder(t) in preorder(s)

方法三：42ms

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

from hashlib import md5

class Solution(object):
    def isSubtree(self, s, t):
        def treehash(root):
            h = md5(treehash(root.left) + str(root.val) + treehash(root.right)).hexdigest() if root else ''
            hashes.append(h)
            return h
        hashes = []
        h = treehash(t)
        hashes = []
        treehash(s)
        return h in hashes

    def isSubtree(self, s, t):
        def string(root):
            return '(%d,%s,%s)' % (root.val, string(root.left), string(root.right)) if root else ''
        return string(t) in string(s)

    def isSubtree(self, s, t):
        def tuplify(root):
            return (root.val, tuplify(root.left), tuplify(root.right)) if root else None
        return str(tuplify(t)) in str(tuplify(s))