双向链表二叉树

//双向链表二叉树
private E unlinkFirst(Node<E> f){
	//assert f == first && f != null;
	final E element = f.item;
	final Node<E> next = f.next;
	f.item = null;//上一个设为null
	f.next = null;//下一个设为null
	first = next;
	if(next == null){
		//单个情况
		last = null;
	}else{
		//多个情况
		next.prev = null;
	}
	x.item = null;
	size--;
	modCount++;
	return element;
}