forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path100.cpp
More file actions
46 lines (42 loc) · 1.16 KB
/
100.cpp
File metadata and controls
46 lines (42 loc) · 1.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
//method1: good old recursion
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(!p && !q) return true;
if(!p || !q) return false;
bool c1=isSameTree(p->left,q->left);
bool c2=isSameTree(p->right,q->right);
bool c3=(p->val==q->val);
return c1 && c2 &&c3;
}
};
//method2: Level Order Traversal // BFS
class Solution {
public:
void levelOrderTraversal(TreeNode* root,vector<int> &v){
int h=height(root);
for(int i=1;i<=h;i++) traverseLevel(root,i,v);
}
void traverseLevel(TreeNode* node,int level,vector<int> &v){
if(level==1){
if(node) v.push_back(node->val);
else v.push_back(0);
}
else{
if(node){
traverseLevel(node->left,level-1,v);
traverseLevel(node->right,level-1,v);
}
}
}
int height(TreeNode* node){
if(!node) return 0;
return max(height(node->left),height(node->right))+1;
}
bool isSameTree(TreeNode* p, TreeNode* q) {
vector<int> v1,v2;
levelOrderTraversal(p,v1);
levelOrderTraversal(q,v2);
return v1==v2;
}
};