Why would you implement a stack or queue using a link list rather than array or vector implementation?
<p>So I know that implementing a stack or queue using vector or an array have these properties:</p>

<ul>
<li>O(n) for searching</li>
<li>At least with array implementation (All on the stack rather than heap)</li>
<li>O(1) peek top/front or back/bottom </li>
</ul>

<p>And if array's space constraint is an issue you would implement the stack or queue using a vector, so why would anyone implement one of these data structures using a link list? Any real life examples would be great, and Big O notation of some basic functionality if differ from array/vector implementation.</p>