func ContainsTree(t1, t2 *tree.Tree) bool {
	sb1 := &strings.Builder{}
	sb2 := &strings.Builder{}
	getOrderString(t1, sb1)
	getOrderString(t2, sb2)
	str1 := sb1.String()
	str2 := sb2.String()
	return strings.Contains(str1, str2)
}
//ContainsTree solves ch04-p10

ContainsTree solves ch04-p10
// ContainsTree solves ch04 - p10
func ContainsTree(t1, t2 *tree.Tree) bool {
	sb1 := &strings.Builder{}
	sb2 := &strings.Builder{}
	getOrderString(t1, sb1)
	getOrderString(t2, sb2)
	str1 := sb1.String()
	str2 := sb2.String()
	return strings.Contains(str1, str2)
}
func ContainsTree ( t1 , t2 * tree . Tree ) bool { sb1 := & strings . Builder { } sb2 := & strings . Builder { } getOrderString ( t1 , sb1 ) getOrderString ( t2 , sb2 ) str1 := sb1 . String ( ) str2 := sb2 . String ( ) return strings . Contains ( str1 , str2 ) }
ContainsTree solves ch04-p10
ContainsTree solves ch04 - p10