Same Tree Java Solutions

Given binary trees, write a function to check if they is equal or not.

The binary trees is considered equal if they is structurally identical and the nodes has the same value.

Subscribe to see which companies asked this question

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  */Ten  Public classSolution { One      Public BooleanIssametree (TreeNode p, TreeNode q) { A         if(p = =NULL&& Q = =NULL)return true; -         if(p = =NULL&& Q! =NULL) || (P! =NULL&& Q = =NULL) )return false; -         returnP.val==q.val && issametree (p.left,q.left) &&Issametree (p.right,q.right); the     } -      -}

Recursion is important to determine the recursive exit, the first recursive exit is not determined well, resulting in the inability to AC.

Same Tree Java Solutions