leetcode刷题：二叉树13（相同的树）

100. 相同的树

力扣题目链接

给定两个二叉树，编写一个函数来检验它们是否相同。

如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。

傻瓜式方法，按p的轨迹遍历运行一遍，再按q的轨迹遍历运行一遍。

package com.programmercarl.tree;

import lombok.val;

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

/** * @ClassName IsSameTree * @Descriotion TODO * @Author nitaotao * @Date 2022/7/4 19:50 * @Version 1.0 **/
public class IsSameTree {
    
    public boolean isSameTree(TreeNode p, TreeNode q) {
    
        if (p == null && q == null) {
    
            return true;
        }
        TreeNode tempP=p;
        TreeNode tempQ=q;
        Stack<TreeNode> stackP = new Stack<TreeNode>();
        Stack<TreeNode> stackQ = new Stack<TreeNode>();
        while (p != null || !stackP.isEmpty()) {
    
            if (p != null) {
    
                stackP.push(p);
                stackQ.push(q);
                p = p.left;
                if (q == null || stackP.isEmpty()) {
    
                    return false;
                }
                q = q.left;
            } else {
    
                p = stackP.pop();
                q = stackQ.pop();
                if (p.val != q.val) {
    
                    return false;
                }
                p = p.right;
                q = q.right;
            }
        }

        Stack<TreeNode> stackp = new Stack<TreeNode>();
        Stack<TreeNode> stackq = new Stack<TreeNode>();
        while (tempQ != null || !stackq.isEmpty()) {
    
            if (tempQ != null) {
    
                stackp.push(tempP);
                stackq.push(tempQ);
                tempQ= tempQ.left;
                if (tempP == null || stackp.isEmpty()) {
    
                    return false;
                }
                tempP= tempP.left;
            } else {
    
                tempP = stackp.pop();
                tempQ = stackq.pop();
                if (tempP.val != tempQ.val) {
    
                    return false;
                }
                tempP = tempP.right;
                tempQ = tempQ.right;
            }
        }

        return true;
    }
}

看看大佬的 递归+迭代

    public boolean isSameTree(TreeNode p, TreeNode q) {
    
        return compare(p, q);
    }

    //可以看成两个子树，左右子树
    private boolean compare(TreeNode left, TreeNode right) {
    
        if (left == null && right == null) {
    
            return true;
        }
        //不是两个都为空
        //其中为空
        if (left == null || right == null) {
    
            return false;
        }
        if (left.val != right.val) {
    
            return false;
        }
        boolean leftResult = compare(left.left, right.left);
        boolean rightResult = compare(left.right, right.right);
        return leftResult && rightResult;
    }