C++ (Cpp) Tree::IsSubtree Examples

Example #1

File: 4-7.cpp Project: zyli5313/CareerCup

int main()
{
	int iArr[] = {1, 2, 5, 7, 10, 13, 15, 21, 22};
	int low = 0, high = sizeof(iArr) / sizeof(int) - 1; 
	Tree<int> *ptree = new Tree<int>();
	TreeNode<int> *proot = ptree->InitializeTree(iArr, low, high, ptree->GetRoot());
	ptree = new Tree<int>(proot);

	int iArr1[] = {13, 15, 21, 22};
	//int iArr1[] = {13, 15, 221, 223};
	low = 0, high = sizeof(iArr1) / sizeof(int) - 1; 
	Tree<int> *ptreeSub = new Tree<int>();
	proot = ptree->InitializeTree(iArr1, low, high, ptreeSub->GetRoot());
	ptreeSub = new Tree<int>(proot);   

	cout << ptree->IsSubtree(ptree->GetRoot(), ptreeSub->GetRoot()) << endl;

	system("pause");
	return 0;
}