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.
判断两个二叉树是否相同,结点的值和结构都相同。
采用递归来实现。
代码如下:
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 bool isSameTree(TreeNode* p, TreeNode* q) { 13 if(!p && !q) 14 { 15 return true; 16 } 17 if(p && q && p->val == q->val) 18 { 19 if(isSameTree(p->left, q->left)) 20 { 21 if(isSameTree(p->right, q->right)) 22 { 23 return true; 24 } 25 } 26 } 27 return false; 28 } 29 };