【LeetCode with Python】 Same Tree

博客域名：http://www.xnerv.wang
原题页面：https://oj.leetcode.com/problems/same-tree/
题目类型：递归，回溯，DFS
难度评价：★
本文地址：http://blog.csdn.net/nerv3x3/article/details/3465524

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.

判断两个二叉树是否相等。常见的二叉树递归回溯算法。

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