int main() {
TreeNode n1(1), n2(2), n3(3), n4(4), n5(5);
n1.left = &n2; n1.right = &n3;
n2.left = &n4; n2.right = &n5;
TreeNode n6(2), n7(4), n8(5);
n6.left = &n7; n6.right = &n8;
Solution s;
if (s.HasSubtree(&n1, &n6))
cout << "Has." << endl;
else
cout << "Has not." << endl;
TreeNode n9(6);
n7.left = &n9;
if (s.HasSubtree(&n1, &n6))
cout << "Has." << endl;
else
cout << "Has not." << endl;
return 0;
}
int main()
{
Solution s;
vector<int> v1 = { 8, flag, 9, 3, 2 };
vector<int> v2 = {};
TreeNode *root1 = generateTree(v1);
TreeNode *root2 = generateTree(v2);
bool ret = s.HasSubtree(root1, root2);
cout << ret << endl;
system("pause");
return 0;
}
