572. Subtree of Another Tree*
https://leetcode.com/problems/subtree-of-another-tree/
题目描述
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node’s descendants. The tree s could also be considered as a subtree of itself.
Example 1:
Given tree s:
3
/ \
4 5
/ \
1 2
Given tree t:
4
/ \
1 2
Return true, because t has the same structure and node values with a subtree of s.
Example 2:
Given tree s:
3
/ \
4 5
/ \
1 2
/
0
Given tree t:
4
/ \
1 2
Return false.
C++ 实现 1
需要判断 t 是 s 的左子树中的 subtree 还是右子树的 subtree, 亦或是 t 和 s 完全相等.
/**
* 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 {
private:
bool isEqual(TreeNode *s, TreeNode *t) {
if (!s || !t) return s == t;
return s->val == t->val && isEqual(s->left, t->left)
&& isEqual(s->right, t->right);
}
public:
bool isSubtree(TreeNode* s, TreeNode* t) {
if (!s || !t) return s == t;
return isEqual(s, t) || isSubtree(s->left, t) || isSubtree(s->right, t);
}
};