时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32M,其他语言64M 热度指数:790003 本题知识点: 二叉树 树
算法知识视频讲解
题目描述 输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
树的结点:
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
代码的实现思路是:
从根节点开始进行对比,然后用递归回溯进行对比子树。带有递归回溯的算法,想起来比较绕,需要根据例子来进行边捋边思考
#include<iostream>
#include <vector>
#include <functional>
#include <algorithm>
#include <string>
#include<map>
using namespace std;
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
bool defs(TreeNode* tree1, TreeNode* tree2)
{
if (!tree2) return true;
if (!tree1) return false;
if (tree1->val != tree2->val) return false;
return defs(tree1->left, tree2->left) && defs(tree1->right, tree2->right);
}
bool hasSubTree(TreeNode* tree1, TreeNode* tree2)
{
//如果这两个树有一个为空的话,就返回false
if (!tree1) return false;
if (!tree2) return false;
return (defs(tree1, tree2) || hasSubTree(tree1->left, tree2) || hasSubTree(tree1->right, tree2));
}
int main(int argc,char *agrv[])
{
TreeNode * tree1 = new TreeNode(1);
TreeNode * ltree = new TreeNode(2);
TreeNode * rtree = new TreeNode(3);
tree1->left = ltree; tree1->right = rtree;
TreeNode * tree2 = new TreeNode(10);
cout << hasSubTree(tree1, tree2) << endl;;
cout<<"Hello..."<<endl;
system("pause");
return 0;
}