Leetcode-Solution/[100] Same Tree.java at main · PAPPURAJ/Leetcode-Solution · GitHub

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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {

    boolean out=true;

    void trav(TreeNode a, TreeNode b){
        if(a==null && b==null)return;
        else if(a==null && b!=null){
            out=false;
            return;
            }
        else if(a!=null && b==null){
            out=false;
            return;
            }
        else if(a.val!=b.val){
            out=false;
            return;
            }
       trav(a.left,b.left);
       trav(a.right,b.right);

        }


    public boolean isSameTree(TreeNode p, TreeNode q) {
        trav(p,q);

            return out;


    }
}