Leetcode学习笔记：#572. Subtree of Another Tree

Leetcode学习笔记：#572. Subtree of Another Tree

Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node’s descendants. The tree s could also be considered as a subtree of itself.

实现：

public boolean isSubtree(TreeNode s, TreeNode t){
	if(s == null) return false;
	if(isSame(s,t)) return true;
	return isSubtree(s.left, t) || isSubtree(s.right, t);
}

public boolean isSame(TreeNode s, TreeNode t){
	if(s == null && t == null) return true;
	if(s == null && t == null) return false;
	if(s.val != t.val) return false;
	return isSame(s.left, t.left) && isSame(s.right, t.right);
}

思路：
用一个辅助方法判断该节点是否值相等，再递归判断以该节点为根节点的树是否相等。