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.
用递归来解决。
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 public class Solution { 11 public boolean isSameTree(TreeNode p, TreeNode q) { 12 13 if(p==null||q==null){ 14 15 return p==q; 16 } 17 if(p.val!=q.val){ 18 19 return false; 20 } 21 22 return isSameTree(p.right, q.right) && isSameTree(p.left, q.left);//Recursive递归 23 24 } 25 }
280 ms.