Laufzeiten von Datenstrukturen

 insert(k)get(i)insertAfterdelete(k)
ArrayO(1)O(1)O(n)O(n)
1-verkettete ListeO(1)O(n)O(1)O(n)
2-verkettete ListeO(1)O(n)O(1)O(1)
HeapO(log n)O(1)O(log n)
Bin. SuchbaumO(h) = O(log n)O(log n)O(log n)O(h) = O(log n)
2-3-BaumO(log n)O(log n)O(log n)O(log n)