Created
December 23, 2013 06:40
-
-
Save wayetan/8092606 to your computer and use it in GitHub Desktop.
Same Tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* 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 binary tree | |
* public class TreeNode { | |
* int val; | |
* TreeNode left; | |
* TreeNode right; | |
* TreeNode(int x) { val = x; } | |
* } | |
*/ | |
public class Solution { | |
public boolean isSameTree(TreeNode p, TreeNode q) { | |
if(p == null && q == null) return true; | |
if((p == null && q != null) || (p != null && q == null)) return false; | |
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right) && p.val == q.val; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment