Stack (LIFO)

O(1) push/pop

push(val): arr[top++] = val pop(): return arr[--top]

Size0

Top–

Empty?Yes

Target / Top Element

Active (Push/Pop)

Success / Found