(tree p, tree q)
| 1 | public class sameTree { |
| 2 | |
| 3 | public static boolean isSameTree(tree p, tree q) { |
| 4 | if (p == null && q == null) { |
| 5 | return true; |
| 6 | } |
| 7 | if (p == null || q == null || p.val != q.val) { |
| 8 | return false; |
| 9 | } |
| 10 | return (isSameTree(p.left, q.left) && isSameTree(p.right, q.right)); |
| 11 | } |
| 12 | |
| 13 | public static void main(String[] args) { |
| 14 | tree root = new tree(1, new tree(2), new tree(3)); |