stacks in computer science

what is stacks.....

Stacks ek non-primitive data structure hota hai. Jisame kisi new data item ko add ya pahale se present data item ko delete karane ka kam stack ke ek end (chhor) se kiya jata hai. Jisse stack ka top kahate hai. Issi top se all data item ka Insertion aur deletion kiya jata hai . Stack me jo data item last me add kiya jata hai vah delection ke time sabase pahale delete hota hai. Issi vajah se isse last-in-first-out(LIFO) type ka list bhi kaha jata hai.

SEEN(A)

(3)

SEEN(B)

Example=

stack ko hum ek common example se samajate hai stack of plates in a marriage party jaha par fresh plates ko top par rakha jata hai and top se hi plates remove kiya jata hai.

 

plates in marriage party.

(4)SEEN

example.2

kisi book ko cupboard me rakhane par hum vahi book sabare first me recive karage jise sabase last me rakha hoga .

SEEN(5)

EXAMPLE 3=

HAND ME CHUDIYO KO PAHANANE AUR UTARANE KE LIYE STACK KI PROPERTIES KA HI USE HOTA HAI.

Basic Features of stack

1. stack ek last-in-first-out type ka data structure hai.

2.Stack me data item ko insert karane ke liye push()function ka use kiya jata hai.

3.Stack me data item ko delete karane ke liye pop()function ka use kiya jata hai.

4.yadi kisi stack ki size puri tarah full ho gai hai to data item ko add (insertion) karate samay overflow state ban jate hai .Jabaki ek essa bhi state aata hai jab stack me koi bhi data item nahi hoti hai wo state underflow kahalata hai.