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.
/**
用递归的方法实现,碰到树的题目,第一时间考虑递归。不要忘记了几个判定的case,不然递归就一直死循环了, p, q都是 null, return ture, 其中一个是null 一个不是, return false。
* Definition for binary tree
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public bool IsSameTree(TreeNode p, TreeNode q)
{
bool sameflag = true;
if (p == null && q == null)
return true;
else if (p == null || q == null)
return false;
else if (p.val != q.val)
return false;
else
return (IsSameTree(p.left, q.left) && IsSameTree(p.right, q.right));
}
}
先判断特殊情况,是否有根节点,然后判断左子树和右子树。