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. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { return getResult(p,q); } public boolean getResult(TreeNode p,TreeNode q){ if( p == null && q == null ) return true; else if( p == null || q == null) return false; if( p.val != q.val) return false; return getResult(p.left,q.left)&&getResult(p.right,q.right); } }