Data Structures: Stack [ADT]

Опубликовано: 24 Май 2020
на канале: ZiksA Tut

115

A stack is an Abstract Data Type (ADT), commonly used in most programming languages. It is named stack as it behaves like a real-world stack, for example – a deck of cards or a pile of plates, etc.
A real-world stack allows operations at one end only. For example, we can place or remove a card or plate from the top of the stack only. Likewise, Stack ADT allows all data operations at one end only. At any given time, we can only access the top element of a stack.

This feature makes it LIFO data structure. LIFO stands for Last-in-first-out. Here, the element which is placed (inserted or added) last, is accessed first. In stack terminology, insertion operation is called PUSH operation and removal operation is called POP operation.

Basic Operations
Stack operations may involve initializing the stack, using it and then de-initializing it. Apart from these basic stuffs, a stack is used for the following two primary operations −
push() − Pushing (storing) an element on the stack.
pop() − Removing (accessing) an element from the stack.

To use a stack efficiently, we need to check the status of stack as well. For the same purpose, the following functionality is added to stacks −
peek() − get the top data element of the stack, without removing it.
isFull() − check if stack is full.
isEmpty() − check if stack is empty.

На этой странице сайта вы можете посмотреть видео онлайн Data Structures: Stack [ADT] длительностью online в хорошем качестве, которое загрузил пользователь ZiksA Tut 24 Май 2020, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 115 раз и оно понравилось 25 зрителям. Приятного просмотра!

781