public BTree(int m) {

		// f = frame;
		data = 0; // 壬ͬ
		node = 0;
		state = State.wait;
		root = null;
		this.m = m;
		cnt = new Counter(m, LENGTH, 2 * HEIGHT);
		stack = new Stack<BTreeNode>();
		mid = (int) Math.ceil((m + 0.0) / 2);
		// root = new BTreeNode(rootX, rootY);
		// root.add(100);
		// root.add(20);
		// stack.push(root);
		repaint();

	}