100.判断树是否相同

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.
 * 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||!q)
        {
            if(p==q)
                return true;
            else{
                return false;
            }
        }
        if(p->val!=q->val)
            return false;
        if(isSameTree(p->left,q->left)&&isSameTree(p->right,q->right))
            return true;
        else{
            return false;
        }
    }
};

性能

这里写图片描述

猜你喜欢

转载自blog.csdn.net/m0_37625947/article/details/77941846