题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
python实现:
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
"""
1.先在pRoot1中找到与pRoot2根节点一样值得节点,找到则转2
2.递归检查除根节点外的其他节点值是否相等
"""
def HasSubtree2(self, pRoot1, pRoot2):
# write code here
#采用先序遍历查找pRoot1
if pRoot2 is None:
return False
result = False
if pRoot1:
if pRoot1.val==pRoot2.val:
result = self.check(pRoot1, pRoot2)
#if not result:#这种写法也AC
# result = self.HasSubtree(pRoot1.left, pRoot2) or self.HasSubtree(pRoot1.right, pRoot2)
if not result:
result = self.HasSubtree(pRoot1.left, pRoot2)
if not result:
result = self.HasSubtree(pRoot1.right, pRoot2)
return result
# 或这样写:
def HasSubtree(self, pRoot1, pRoot2):
if pRoot1 is None or pRoot2 is None:
return False
if pRoot1.val != pRoot2.val:
return self.HasSubtree(pRoot1.left, pRoot2) or self.HasSubtree(pRoot1.right, pRoot2)
# ==
result = self.check(pRoot1.left, pRoot2.left) and self.check(pRoot1.right, pRoot2.right) # 左右子树是否都是match的
if not result: # 不match,则还要继续检查pRoot1的其他节点
return self.HasSubtree(pRoot1.left, pRoot2) or self.HasSubtree(pRoot1.right, pRoot2)
return result
def check(self, pRoot1, pRoot2):
if pRoot2 is None:
return True##############注意:这里是True,而不是False
if pRoot1 is None:
return False
if pRoot1.val==pRoot2.val:
return self.check(pRoot1.left, pRoot2.left) and self.check(pRoot1.right, pRoot2.right)
return False
# 或者这样写:
def HasSubtree(self, pRoot1, pRoot2):
# write code here
#Jane:判断pRoot2是不是pRoot1的子树
if pRoot2 is None:
return False
return self.isContains(pRoot1, pRoot2)
def isContains(self, root1, root2):
if root2 is None:
return True
if root1 and root2:
if root1.val == root2.val:
result = self.isContains(root1.left, root2.left) and self.isContains(root1.right, root2.right)
if result:
return True
return self.isContains(root1.left, root2) or self.isContains(root1.right, root2)
else:
return False
c++实现:
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot2==NULL)
return false;
bool result = false;
if(pRoot1){
result = check(pRoot1, pRoot2);
if(!result)
result = HasSubtree(pRoot1->left, pRoot2) || HasSubtree(pRoot1->right, pRoot2);
}
return result;
}
bool check(TreeNode* pRoot1, TreeNode* pRoot2){
if(pRoot2==NULL)
return true;
if(pRoot1==NULL)
return false;
if(pRoot1->val==pRoot2->val)
return check(pRoot1->left, pRoot2->left) && check(pRoot1->right, pRoot2->right);
return false;
}
};