深度优先搜索——相同的树

最新推荐文章于 2023-02-01 22:50:51 发布

akun+

最新推荐文章于 2023-02-01 22:50:51 发布

阅读量147

点赞数

分类专栏： leetcode——深度优先搜索文章标签：算法

本文链接：https://blog.csdn.net/m0_51467734/article/details/119924478

版权

leetcode——深度优先搜索专栏收录该内容

10 篇文章 0 订阅

订阅专栏

一、深度优先搜索，递归

Java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p==null&&q==null) return true;
        if((p==null&&q!=null)||(q==null&&p!=null)) return false;
        if(p.val!=q.val) return false;
        return isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
    }
}

二、广度优先搜索，不需要按照中序遍历的顺序，直接加入左子树和右子树即可

Java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        Queue<TreeNode> que=new LinkedList<TreeNode>();
        que.offer(p);
        que.offer(q);
        while(!que.isEmpty()){
            q=que.poll();
            p=que.poll();
            if(p==null&&q==null) continue;
            if(p==null||q==null) return false;
            if(p.val!=q.val) return false;
            que.offer(p.left);
            que.offer(q.left);
            que.offer(p.right);
            que.offer(q.right);
        }
        return true;
    }
}

c++:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        queue<TreeNode*> que;
        que.push(p);
        que.push(q);
        while(!que.empty()){
            q=que.front();
            que.pop();
            p=que.front();
            que.pop();
            if(p==nullptr&&q==nullptr) continue;
            if(p==nullptr||q==nullptr) return false;
            if(p->val!=q->val) return false;
            que.push(p->left);
            que.push(q->left);
            que.push(p->right);
            que.push(q->right);
        }
        return true;
    }
};