题目1520：树的子结构

最新推荐文章于 2022-12-06 02:56:49 发布

Rabbit誩

最新推荐文章于 2022-12-06 02:56:49 发布

阅读量339

点赞数

分类专栏：九度|剑指OFFER 文章标签：树的子结构二叉树

本文链接：https://blog.csdn.net/u010911170/article/details/44154211

版权

九度|剑指OFFER 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

找B的跟节点和A的跟节点一样的点，在遍历左右子树，如果都相同则返回true，否则继续寻找

#include<cstdio>
#include<cstring>

typedef struct node 
{
	int val;
	struct node *left;
	struct node *right;
	void setVal(int v)
	{
		this->val = v;
		left = right = NULL;
	}
}Tree;


int n,m;

void createTree(int n,Tree tree[])
{
	int val,childIndex;
	if(n == 0)
		return;
	for(int i=0;i<n;++i)
	{
		scanf("%d",&val);
		tree[i].setVal(val);
	}
	for(int i=0;i<n;++i)
	{
		scanf("%d",&val);
		if(val == 1)
		{
			scanf("%d",&childIndex);
			tree[i].left = &tree[childIndex-1];
		}
		else if(val == 2)
		{
			scanf("%d",&childIndex);
			tree[i].left = &tree[childIndex-1];
			scanf("%d",&childIndex);
			tree[i].right = &tree[childIndex-1];
		}
	}
}

bool isSubTree(Tree *aTree,Tree*bTree)
{
	if(bTree == NULL)
		return true;
	if(aTree == NULL)
		return false;
	if(aTree->val != bTree->val)
		return false;
	return isSubTree(aTree->left,bTree->left) && isSubTree(aTree->right,bTree->right);
}

bool checkSubTree(Tree *aTree,Tree *bTree)
{
	bool is = false;
	if(aTree != NULL && bTree != NULL)
	{
		if(aTree->val == bTree->val)
		{
			 is = isSubTree(aTree,bTree);
		}
		if(!is && aTree->left != NULL)
		{
			is = checkSubTree(aTree->left,bTree);
		}
		if(!is && aTree->right != NULL)
		{
			is = checkSubTree(aTree->right,bTree);	
		}
	}
	return is;
}
 
int main()
{
	while(scanf("%d%d",&n,&m) != EOF)
	{
		Tree aTree[1009],bTree[1009];
		createTree(n,aTree);
		createTree(m,bTree);
		if(n <= 0 || m <= 0)
		{
			printf("NO\n");
			continue;
		}
		if(checkSubTree(aTree,bTree))
		{
			printf("YES\n");
		}
		else
		{
			printf("NO\n");
		}
	}
	return 0;
}