LeetCode - Same Tree

来源:互联网 发布:淘宝店和微商的区别 编辑:程序博客网 时间:2024/03/29 18:05

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