标签:des style blog color java strong io cti
题目:
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.
题解:
递归判断左右是否相等。
代码如下:
对上述代码更简洁的写法是:
Same Tree leetcode java,布布扣,bubuko.com
标签:des style blog color java strong io cti
原文地址:http://www.cnblogs.com/springfor/p/3879575.html