Basic Operations of stack -:push and Pop takes constant time $\Omega \left ( 1 \right )$,But searching an element will take $O\left ( n \right )$ as in the worst case you may have to pop 'n' element to get the key if the key is present at the bottom of stack.
Note -:Searching is not basic operation of stack.
64.3k questions
77.9k answers
243k comments
79.7k users