public void computeOrdering() { int co[] = new int[0]; int i, j, k, m, e; Iterator it = children.iterator(); while (it.hasNext()) { Node child = (Node) it.next(); child.computeOrdering(); co = merge(co, child.o); } o = new int[1 + co.length]; o[0] = c; System.arraycopy(co, 0, o, 1, co.length); }