void makeTree(LinkedList<TreeLinkNode> A) {
		if (A.isEmpty())
			return;
		LinkedList<TreeLinkNode> nextA = new LinkedList<TreeLinkNode>();
		TreeLinkNode cur = null;
		TreeLinkNode pre = null;
		while (!A.isEmpty()) {
			cur = A.remove();
			if (cur.left != null)
				nextA.add(cur.left);
			if (cur.right != null)
				nextA.add(cur.right);
			if (pre != null)
				pre.next = cur;
			pre = cur;
		}
		if (pre != null)
			pre.next = null;
		makeTree(nextA);
	}