【题目】
给定彼此独立的两颗树头结点分别是t1和t2，判断t1树是否包含t2树全部的拓扑结构
package zyc.binaryTree;public class P143_ContainsTopology {public static void main(String[] args) {Node node = new Node(1);node.left = new Node(2);node.left.left = new Node(4);node.left.left.left = new Node(8);node.left.left.right = new Node(9);node.left.right = new Node(5);node.left.right.left = new Node(10);node.right = new Node(3);node.right.left = new Node(6);node.right.right = new Node(7);Node node1 = new Node(2);node1.left = new Node(4);node1.left.left = new Node(8);node1.right = new Node(5);boolean contains = contains(node, node1);System.out.println(contains);}public static boolean contains(Node t1, Node t2) {if (t2 == null) {return true;}if (t1 == null) {return false;}return check(t1, t2) || contains(t1.left, t2) || contains(t1.right, t2);}public static boolean check(Node h, Node t2) {if (t2 == null) {return true;}if (h == null || h.value != t2.value) {return false;}return check(h.left, t2.left) || check(h.right, t2.right);}public static class Node {public int value;public Node left;public Node right;public Node(int value) {this.value = value;}}
}