EEPW论坛

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.

题意：判断两个树是否相等

1. class Solution  

2. {  

3. public:  

4.     bool isSameTree(TreeNode* p, TreeNode* q)  

5.     {  

6.         if (p==NULL && q==NULL)  

7.         {  

8.             return true;  

9.         }  

10.   

11.         if (p==NULL || q==NULL)  

12.         {  

13.             return false;  

14.         }  

15.   

16.         if (p->val!=q->val)  

17.         {  

18.             return false;  

19.         }  

20.   

21.         return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);  

22.     }  

23. };