Identical Binary Tree

Check if two binary trees are identical.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

package BinaryTree; /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.val = val; * this.left = this.right = null; * } * } */ public class IdenticalTree { /** * @param a, b, the root of binary trees. * @return true if they are identical, or false. */ public boolean isIdentical(TreeNode a, TreeNode b) { // Write your code here if (a == null && b == null) return true; if (a != null && b != null) { return a.val == b.val && isIdentical(a.left, b.left) && isIdentical(a.right, b.right); } return false; } }