Lintcode 1165. Subtree of Another Tree (Easy) (Python)

Subtree of Another Tree

Description:

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
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.

Code:

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param s: the s' root
    @param t: the t' root
    @return: whether tree t has exactly the same structure and node values with a subtree of s
    """
    def compareTree(self, s, t):
        if (s==None) or (t==None):
            return (s==None) and (t==None)
        if s.val != t.val:
            return False
        if self.compareTree(s.left, t.left)==False or self.compareTree(s.right, t.right)==False:
            return False
        return True


    def isSubtree(self, s, t):
        # Write your code here
        if (s==None) or (t==None):
            return (s==None) and (t==None)
        if self.compareTree(s, t) == True:
            return True
        return self.isSubtree(s.left,t) or self.isSubtree(s.right, t)