leetcode 100. Same Tree

来源:互联网 发布:双十一数据增长文献 编辑:程序博客网 时间:2024/06/05 23:39

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) return !q;        if(!q) return !p;        if(p->val == q->val) return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);        else return false;    }};
原创粉丝点击