-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
76 lines (61 loc) · 1.17 KB
/
main.cpp
File metadata and controls
76 lines (61 loc) · 1.17 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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
// 两棵树A,B,判断B是不是A的子树
#include <iostream>
struct BinTreeNode
{
BinTreeNode *m_lChild;
BinTreeNode *m_rChild;
char m_value;
};
BinTreeNode * CreateTree()
{
BinTreeNode *root = new BinTreeNode;
root->m_lChild = nullptr;
root->m_rChild = nullptr;
char ch;
std::cin >> ch;
if (ch != '#')
{
root->m_value = ch;
root->m_lChild = CreateTree();
root->m_rChild = CreateTree();
}
return root;
}
bool DoesTree1HaveTree2(BinTreeNode *root1, BinTreeNode *root2)
{
if (!root2)
return true;
if (!root1)
return false;
if (root1->m_value != root2->m_value)
return false;
return DoesTree1HaveTree2(root1->m_lChild, root2->m_lChild) &&
DoesTree1HaveTree2(root1->m_rChild, root2->m_rChild);
}
bool HasSubTree(BinTreeNode *root1, BinTreeNode *root2)
{
bool ret = false;
if (root1 && root2)
{
if (root1->m_value == root2->m_value)
{
ret = DoesTree1HaveTree2(root1, root2);
}
if (!ret)
{
ret = HasSubTree(root1->m_lChild, root2);
}
if (!ret)
{
ret = HasSubTree(root1->m_rChild, root2);
}
}
return ret;
}
int main()
{
BinTreeNode *root1 = CreateTree();
BinTreeNode *root2 = CreateTree();
bool ret = HasSubTree(root1, root2);
return 0;
}