题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
C++实现:
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool doeshavetree(TreeNode* p1, TreeNode* p2)
{
if(p2 == NULL)
return true;
if(p1 == NULL)
return false;
if(p1 -> val != p2 -> val)
return false;
return doeshavetree(p1 -> left, p2 -> left) && doeshavetree(p1 -> right, p2 -> right);
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
bool result = false;
if(!pRoot2 || !pRoot1)
return false;
if(pRoot1 -> val == pRoot2 -> val)
result = doeshavetree(pRoot1, pRoot2);
if(!result)
result = HasSubtree(pRoot1 -> left, pRoot2);
if(!result)
result = HasSubtree(pRoot1 -> right, pRoot2);
return result;
}
};
python实现:
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def HasSubtree(self, pRoot1, pRoot2):
# write code here
def convert(p):
if p:
return str(p.val) + convert(p.left) + convert(p.right)
else:
return ''
if pRoot2:
if convert(pRoot2) in convert(pRoot1):
return True
else:
return False
return False