【Same Tree】

Given the roots of two binary trees p and q, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.

Example 1:

Input: p = [1,2,3], q = [1,2,3]
Output: true

Example 2:

Input: p = [1,2], q = [1,null,2]
Output: false

Example 3:

Input: p = [1,2,1], q = [1,1,2]
Output: false

Constraints:

• The number of nodes in both trees is in the range [0, 100].
• -10⁴ <= Node.val <= 10⁴

completion:

/**
 * 递归判断是否是相同的二叉树
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null && q == null) {
            return true;
        } else if (p == null || q == null) {
            return false;
        } else {
            if (p.val == q.val) {
                return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
            } else {
                return false;
            }
        }
    }
}

/**
 * 非递归判断是否是相同的二叉树
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        Stack<TreeNode> stack1 = new Stack<>();
        Stack<TreeNode> stack2 = new Stack<>();
        boolean isSame = true;

        if (p == null && q == null) {
            return isSame;
        } else if (p == null || q == null) {
            isSame = false;
            return isSame;
        } else {
            stack1.add(p);
            stack2.add(q);
            while (!stack1.isEmpty()) {
                TreeNode root1 = stack1.pop();
                TreeNode root2 = stack2.pop();

                if (root1.val != root2.val) {
                    isSame = false;
                    break;
                }
                if (root1.left != null && root2.left != null) {
                    stack1.add(root1.left);
                    stack2.add(root2.left);
                } else if (root1.left == null && root2.left == null) {

                } else {
                    isSame = false;
                    break;
                }
                if (root1.right != null && root2.right != null) {
                    stack1.add(root1.right);
                    stack2.add(root2.right);
                } else if (root1.right == null && root2.right == null) {
                } else {
                    isSame = false;
                    break;
                }
            }
        }

        return isSame;
    }
}