subTree

题目：

 输入两棵树A，B，判断B是否是A数的子树

tips：先遍历找出A和B的root节点val值相同的节点，然后由此出发，判断之后的左右子树是否相同。递归算法：

代码

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 result=false;
    	if(root1!=null&&root2!=null){
    		if(root1.val==root2.val){
    			result=DoesTreeAHaveTreeB(root1,root2);
    		}
    		if(result==false){
    			result=HasSubtree(root1.left,root2);
    		}
    		if(result==false){
    			result=HasSubtree(root1.right,root2);
    		}
    	}
    	return result;
    }
	public boolean DoesTreeAHaveTreeB(TreeNode root1,TreeNode root2){
		if(root2==null)return true;
		if(root1==null)return false;
		if(root1.val!=root2.val)return false;
		return DoesTreeAHaveTreeB(root1.left,root2.left)&&DoesTreeAHaveTreeB(root1.right,root2.right);
	}
}