leetcode：Same Tree

题目

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 a binary tree node.
 * 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) {
            if (q == null)
                return true;
            else
                return false;
        }
        else {
            if(q == null)
                return false;
        }
        if (p.val != q.val)
            return false;
        else {
            boolean bool1 = isSameTree(p.left, q.left);
            boolean bool2 = isSameTree(p.right, q.right);
            return bool1 & bool2;
        }
    }
}

优化：

参考leetcode讨论区答案

public boolean isSameTree(TreeNode p, TreeNode q) {
    if(p == null || q == null) return (p == q);
    if(p.val == q.val)
        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
    return false;
}

非递归解法

public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null && q == null)
            return true;
        else if (p == null || q == null)
            return false;
        Stack<TreeNode> stack_p = new Stack<>();
        Stack<TreeNode> stack_q = new Stack<>();
        if(p != null) stack_p.push(p);
        if(q != null) stack_q.push(q);
        while(!stack_p.empty() && !stack_q.empty()) {
            TreeNode pn = stack_p.pop();
            TreeNode qn = stack_q.pop();
            if (pn.val != qn.val) return false;
            if ((pn.right != null && qn.right == null) || (pn.right == null && qn.right != null) || (pn.left != null && qn.left == null) || (pn.left == null && qn.left != null))
                return false;
            if(pn.right != null) stack_p.push(pn.right);
            if(qn.right != null) stack_q.push(qn.right);
            // stack没有size方法
            //if (stack_p.size != stack_q.size) return false;
            if(pn.left != null) stack_p.push(pn.left);
            if(qn.left != null) stack_q.push(qn.left);
            //if (stack_p.size != stack_q.size) return false;
        }
        return true;
    }
}