same-tree.py

# https://leetcode.com/problems/same-tree/
#
# Given two binary trees, write a function to check if they are equal or not.
#
# Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

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

class Solution:
    # @param p, a tree node
    # @param q, a tree node
    # @return a boolean
    def isSameTree(self, p, q):
    	if p==None and q == None :
    		return True
    	elif p== None or q ==None:
    		return False
    	elif p.val == q.val:
    		return self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right)
    	else:
    		return False