leetcode100

1. 题目

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.

2. 思路

1.使用深度优先搜索（DFS)和广度优先搜索(BFS)来进行对图的遍历

2.遍历之前我们得保证他们的二叉树的结构是一样的 缺胳膊少腿的那肯定返回false了，然后再来进行遍历他们的值是否相等

3. 代码

3.1 DFS

#include <iostream>



using namespace std;
// Definition for a binary tree node.
struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        
        
        // 1. 保证结构是一样的
        if (p == nullptr && q == nullptr) // 递归的终止条件： 如果两个都是空节点
        {
            return true;
        }
        else if ((p == nullptr) ||  (q == nullptr))
        {
            return false;
        }
        // 2. DFS 进行遍历
        else if (p->val != q->val)
        {
            return false; // 递归的终止条件： 如果两个节点的值不相等
            
        }
        else
        {
            return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
        }

    }
};

int main() {
    Solution solution;

    // 构建两棵示例树
    TreeNode* tree1 = new TreeNode(1);
    tree1->left = new TreeNode(2);
    tree1->right = new TreeNode(3);
    tree1->left = new TreeNode(4);

    TreeNode* tree2 = new TreeNode(1);
    tree2->left = new TreeNode(2);
    tree2->right = new TreeNode(3);
    tree2->left = new TreeNode(8);

    std::cout << (solution.isSameTree(tree1, tree2) ? "true" : "false") << std::endl;

    return 0;
}

3.2 BFS

#include <iostream>
#include<vector>
#include<queue>



using namespace std;
// Definition for a binary tree node.
struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
        
        
       
        if (p == nullptr && q == nullptr) 
        {
            return true;
        }
         if ((p == nullptr) ||  (q == nullptr))
        {
            return false;
        }

            queue<TreeNode*> queue1;
            queue<TreeNode*> queue2; //先进后出的栈
            queue1.push(p);//把节点加入队列
            queue2.push(q);

            while (!queue1.empty() && !queue2.empty())
            {
                auto node1 = queue1.front();
                queue1.pop();
                auto node2 = queue2.front();
                queue2.pop();

                if (node1->val != node2->val)
                {
                    return false; //必须所有的节点的值相同才能返回true 所以使用node1->val != node2->val
                }
                auto left1 = node1->left;
                auto right1 = node1->right;
                auto left2 = node2->left;
                auto right2 = node2->right;
                if ((left1 != nullptr) ^ (left2 != nullptr))
                {
                    return false;
                }
                if ((right1 != nullptr) ^ (right2 != nullptr))
                {
                    return false;
                }
                if (left1 != nullptr)
                {
                    queue1.push(left1); //先进后出
                }
                if (right1 != nullptr)
                {
                    queue1.push(right1);
                }
                if (left2 != nullptr)
                {
                    queue2.push(left2);
                }
                if (right2 != nullptr)
                {
                    queue2.push(right2);
                }
        }
            return queue1.empty() && queue2.empty();
    }
};

int main() {
    Solution solution;

    // 构建两棵示例树
    TreeNode* tree1 = new TreeNode(1);
    tree1->left = new TreeNode(2);
    tree1->right = new TreeNode(3);
    tree1->left = new TreeNode(4);

    TreeNode* tree2 = new TreeNode(1);
    tree2->left = new TreeNode(2);
    tree2->right = new TreeNode(3);
    tree2->left = new TreeNode(9);

    std::cout << (solution.isSameTree(tree1, tree2) ? "true" : "false") << std::endl;

    return 0;
}

4. 总结

1.在循环中总是想写 if( node1.val == node2.val)  {return true;}  这里我们需要的是所有的节点的值相等了才能返回true 单个的节点虽然相等了，但是其他的可能不等 ，应写成  if( node1.val ！= node2.val)  { return false ;} 

2.DFS使用的是递归的办法

3.BFS 得维护一个先进后出的栈，每次弹出最上面的节点进行遍历