Combining Data Structures

How would you:

• insert, delete, find max, find min: all amortized O(1), except insert $O(\log n)$.
• insert, delete, first, next: all O(1).
• insert, delete, find, first, next: all expected O(1), except first, next O(1) worst case.
• insert, delete, find, find min: all $O(\log n)$, except find is O(1) expected.