题目:输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:遍历树A ,每找到一个与树B的头节点相等的值,就进行判断。
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public boolean HasSubtree(TreeNode root1,TreeNode root2) {
boolean res = false;
if(root1!=null && root2!=null){
if(root1.val==root2.val){
res = DoesTree1HaveTree2(root1,root2);
}
if(!res){
res = HasSubtree(root1.left,root2);
}
if(!res){
res = HasSubtree(root1.right,root2);
}
}
return res;
}
public boolean DoesTree1HaveTree2(TreeNode node1,TreeNode node2){
if(node2==null){
return true;
}
if(node1==null){
return false;
}
if(node1.val!=node2.val){
return false;
}
return DoesTree1HaveTree2(node1.left,node2.left)&&DoesTree1HaveTree2(node1.right,node2.right);
}
}