21 static public void main( String args[] ) {
24 Tree[] trees = new Tree[n];
25 for( int i = 0; i < n; ++i ) {
30 // every Node is reachable from only one Tree
35 for( int i = 0; i < n; ++i ) {
42 sillyRemove( t.root );
51 System.out.println( " "+total );
54 static public Tree getTree() {
55 return disjoint jupiter new Tree();
58 static public Node getNode() {
62 static public void build( Tree t ) {
64 t.root.left = getNode();
65 t.root.left.left = getNode();
66 t.root.left.right = getNode();
67 t.root.right = getNode();
68 t.root.right.left = getNode();
69 t.root.right.right = getNode();
72 static public void sillyRemove( Node n ) {
75 n.left.left != null ) {