public DoublyLinkedNode search(E e) {
        DoublyLinkedNode n = head;
        while (n != null) {
            if (n.getKey().equals(e)) {
                return n;
            }
            n = n.getSucc();
        }
        return null;
    }