判断两个二叉树是否相同

最新推荐文章于 2022-12-16 21:48:54 发布

yyy_hr

最新推荐文章于 2022-12-16 21:48:54 发布

阅读量573

点赞数 1

分类专栏： Java

本文链接：https://blog.csdn.net/yyy_hr/article/details/105904642

版权

Java 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

1）递归

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

2）迭代（注：用其它容器也可以，按顺序比较节点就OK）

public boolean isSameTree(TreeNode p, TreeNode q) {
        Stack<TreeNode> stackP = new Stack<>();
        Stack<TreeNode> stackQ = new Stack<>();
        stackP.push(p);
        stackQ.push(q);

        TreeNode currentP, currentQ;
        while ((!stackP.empty()) && (!stackQ.empty())) {
            currentP = stackP.pop();
            currentQ = stackQ.pop();

            if (currentP == null && currentQ == null) {
                continue;
            }
            if (currentP == null || currentQ == null) {
                return false;
            }
            if (currentP.val != currentQ.val) {
                return false;
            }

            stackP.push(currentP.left);
            stackP.push(currentP.right);
            stackQ.push(currentQ.left);
            stackQ.push(currentQ.right);
        }

        return true;
    }