title: Equivalent data structures with same bounds in worst case (vs. amortized)
body: <p>I could not make my title very descriptive, apologies!</p>
  
  <p>Is it the case that for every data structure, supporting some operations with certain amortized running times, another data structure supporting the same operations in the same running times in worst case? I am interested in both the iterative, ephermal data structures and functional ones too.</p>
  
  <p>I am certain that this question must have been asked before. I cannot seem to find the correct search keywords (in Google, SO, TCS). I am looking for a cited answer in {yes, no, open}.</p>