Scribd
Upload
116 views

Data Structures Hand Written Notes On Linear List ADT, Stack ADT, Queue ADT

Uploaded by

Vijaya Sri V K
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
116 views

Data Structures Hand Written Notes On Linear List ADT, Stack ADT, Queue ADT

Uploaded by

Vijaya Sri V K
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 52
Uni -& © R ‘ eprenntabe f_ Single § Tee. Dimentiont nb (@) Arey Baprvventedin shota Clemanki Ff Same eo ao Vevob wad AF date Lpe Om & Continuous mumory docsters pee tnt apes 2 sn uity? cag» el > Srdvidenl clement of on Rerberer Ober dovedd o smabhermatriodl formula 7 Wa tndlen | porboe: — ae; _ > An Boe ojdate wale el aieltieas 2 2p ee g leo called OF at ee plea tou Lid fet Lis LT] ices sent] is a rren-negelve tokeger- Cod Ls, 23, ose 4 iz wen eg Fiask toons ees _— Second ty 4. — Wed ae dae WHE “oH tous and wn! elieru, ebm | Wa dkmantirs of IK atone. = \ War Ikon ae normally tndened beginning ak 4 Xa 4 S26 4 | \ oe. A56 Ss 6aa0 to. 45 Ee A 5 xu maton ; : an Peseta soba | os a A-piok tee oor my Sela bee ellie aes Fak aLrows| [oes Beta i atlas Up Betta. af Priatzin Sl* Of f 5 he el ta clon robin tok heal 08 O a-Dial anag- comport cLesely | g vo Ce Ne eines a template zclaon T> claws matin L pavate: tok teeBows Hee Columns 5 BS iret; lines tg an one4n publi motin (ink t0e8=o7 int colamna}> 0); we moticx O t gid ace ; couk 22% memory cdeollecalid 2eende; ryototl) } int L Celia, CeeRRE, TOS 5 to iameece ; LD veltan Columnas | template ae Piny ts ene ne Meee int Columns) Pus > rout = THOM Bis > columrs = columns) plamesk-= vile Ti UPeoe atslumads Herne int meine) tata cint > (213), yr gilersunk CREA OS Coubee cols eecendts cout 2c mn-gek vetian 05 - 3 ud (cen ee wry _vsing 0 Sige we Bone nan Weta “4 ase rmotivn poy : tote a Uneat Ag i Row- major onder appt * bury ° Me o ° 3 A kxe Spouse male ° ’ © o ° oo 8 O & 6feF Bb e748 & 6 6 oO 4 indian age of ow) &, Clam > clow Sparemattin can be defirad 4 4c tenplate 2eleu T> Claws SpaureMatut 2 Ptivole + fint Rows, cols 5 3 Lo J” mo z Fradances Ordered five collections of BM" ee mo, eberanlig operakions emp: neliinn low bak 0 empl , Fale sigzeld = Sela We Usk Sige Cie ro F thane List) wk (inex): Leben Mie a inder(p (m+ palpate: nde" iy fps ke USE wy rol Wee Lal ee he Aemove | delete Ke tndel® ebment 7 | element wilh high inden alse Rue bp a tnsett (index, ) 3 Insee © % Ihe Ends element errs ait, inden z index have Iie Faden * outpuk( >; output Z Were Aire erase (index) + List Dale stinclia / i aa dl ADT :— ® a Linen tit 0 cottechcy of Cbjels oF Ike Linear Luk Like an atiay Cate Sper vane te, Each tntanee oF wh an Orderd collec danctid 4 Nhe chemenlim of Ng cota slidive [rece ab foustestel teks ty of elements - Ged, trilena 2 of Na fourm (ely es eae tn) Wa i: } si the LE BeOiji a pnk val no Ce them — te Ne elamenli: op, hea EE | Ra indent Se t\ Bee ee trina Ondine Handi re shawl i tek | Beetles + | — sh 5o0 Se empl Eile, 2704) So — , becomes bepou che ey tomes byte On Nore: Othe than prscadence a Brea luk xs: )) tn Adphabelized Usk og whidenle tm clan Bpeeasaep exam Srdradent alomank yf tralones shiny acme " pmratiiod Forrruln roe mae ne a normed fd os oe ae eee A -Dlalnclement shoe a a tmentat, We asta Sherratt hos potters | Locators element[o] » lament Lis 2 clement fauaghese—44 whee Me — 1s We be i ) cls of Me mG” jee Lect lerent- ed [any® VOUT WETORTE Cee TRE PERESSE. i Atay Represertatien mf Jinan. hub Aapresnbalin 9 oe Mt 1 tralenes © iH Gon be ai Ye pyor* oa bey Bie eo} D3 [a3 G3 [uj [sd 15 12) 19 19 Ee rapeleln al elamenk Us We list [5.24% a] is gtoaed in Ne al 4; eal) sok Zc ae oe ii . _@ 0 BO] | [ecto gee i | Tp deeds Pelle Linane lat do o+-4+ © ilies lous speofrectnn 4S template claws Lineothisl i public: | eee wlineochist () 3 Vithrat book empl) coruk = 0; \| Viatual tnt Sige() Coruk = 05 | | | Viulmot Te get(int Hudnden) Conk = 05 | Vinlial tok indexO$ (cont Ta ebibigaileune) cont =o, Vinlael void Kase (ink Iki Index) =O 4 Vislual Void rick (int I fnden , Convt T & Mablement)=0) (Virtwol void output (ostream font) ca awed Ss Viskeal Void oukpokO ZO 5 Nore: We peeve & viabisl deliudse for I Uneslick absherel Chew Ao Hut whin a Bag tance do a Lnearkit re oe ee Whe befostle cderbamelse fer Lineottick fs nab Prveked, Aather the debsucter for Ie tae databipe of Daperancre| Objecb inveked. BS Ei cee Pitt Wan Le Represented ta meRnis one aah ay, a. cece eee a. Linned Usk ental - é Ad a ae ‘he al ee Aistsize — Kesps tanh %F E ontog benf® — kept tanch Of ne copoly a an elment tr" , oor Pig =» fe Aamove amert [13 * ey are clone 93 Oa eg tg Ta elowst [el L fo3,-C32 co 16) pd, 3, 4 Lasenges 4 stale 1+ | cae ) 4 I SSeS eee Ae CREPES CU Ra eee eA ese eee Double Nhan an ~ 4 weal te Represent: & clale a Ua Oe “ pren where Se inctanses ad whenever a atta becom putt a fray Ce doublidig 2 vsed, Ihe total He Apert Ligh A no mae Huan He Hit Ape Tnts Me dale SHacbine — so, ne Ayine & clan tmaplement clos See public 2 \mearlist | i | i public: t ee Unt ti ab Capacity = 10); | : on annglist £77 4) oot n delete LJ element s 3 I] Avr methods Boal Cy cent sila? “ti ee } ie Sok Sige L) const Ak expat ceed L gehuny Mabeiges a J ~e gett Ike Brden) torst 5 tok tndenO$(conul TL Ui elernant)) Cost; Ligh thele | ee Apt Lnewtsk “ft Protectad « chek Inden(ink le Enden) Comat 5 Voie Te dhmentk 5 fork asrayLenglt 5 a3 Tok Lek Sh yes Note: Clos duu dnt te a Cometal clam thade enterds [inhale Ar imasslicl, » 901 mush proide imp! ort gy ie abibsak Dinenalist « ut mnelinds thal At ee abstract claw uz meltcods (vinliiel functions) List clan scan} contain av own and ante wr Gnealist - damtpten 4 ry ote te eratgectes 4 On demplale 2elan T7 ik 277 t omeg re (initial Copooly zo) > 4“ ecendty cout 2e" inital capacily musk be List Cink initial capacily ) 3 ele : Lenglt. = trultalcapacily 5 Clement © Ne” T[amoglergik \ 4 List ge 20, 3 emplalé etl T> ek ¢ anda List Ctomh aed Ik = thelist antag Lergits Bes. = the List- List3e 5 clement = new TLeuagterg hh: Sy ( thelist element » ‘the Liste element + Ustsige » Laler7& thelist) clement); 3 Pr Smplernertalien tonplate Viale. tiz. Void ouaglist<7? ae ude Brden( Ly Ladd we N diadidin 5 Biberpes) “Green ace tle Gndanee” sigs" ue 4 lc Ay mellseds ~| Lb theBnden) Come a | 4 couk y 3 Hews “Megat Dralen- -- eaack_ pgp . ctonplele elor Tr STL_atgoa:ttin te S Nebaw an Weolie do Wa flask elarrant Hak com sis 29 -y . ave elu [ina ( sae att elamutt b)w fiat & tok, eberrant= Pointed by Piast Tp finds the elarant al te Vole in Ic given )) e fn Wi Lomge [Amt last) nine TS punt) the func Jabiru Lost | feat, volo) | ) hale eee Chament potrlsd boy lest Nore: Urry find STL 7 PE BL 4 Vadne tebe gill eee wore Leet ptlads raselesgile Binlade colgeun | Hemplats 2¢clar T> int asegltt eT7 tt ndenOt(eort TS HhaBlerunt) Corse fot thednder = (int) yen -)5 tbe elie thednden ; Find (element 5 elarmanke-+ Usk Ze aclerant) = G( theDrclen = = lute) ae ee template eclan T> Void gee 27> 13 Chose (Tok ME Grelen) 2 check Inder (dra Dnclen) Copy (element + the Drlenst element og Lisle ye yelement + Ure inden), element [--Ustsge] TO) 5 Hinwka dastamelae J os 07 ehomust EG Mirai a nen element ou tle Yalnsln lara: Fae D move element tednden Hrogh Usttipe—| Oru posit up (wight | 2) Owak Ne neo clerk fh posken Hafodan | 3) Tntewant I Listeze hy 4 NOTE: pease meve of clemadz ie accomplubad by wing Bieeiesast Sre punch Rall. Men py fund) move clorunlh degenng ilk We rig hbrnest clamet tek 4 to be moved. a Copy—backioaed = copia Ne rant in Ihe vorge [fat dest) Spey ee as 2 Copy bechwooed ( Sink, dob, rresulk) ten plate eclon T> Void se Jinseck (iE Wa Dndex , ort TEL HheE leant) 2 so aad 500 De > stein) on, Sco en ee lees 8 copy Lateecaad (Clements thedrdan » clement +bstinge elermank+ istije clement [theOndex') = theElement; , 5 MDS 5 bats Ts ail 0 ee = Foumilsty ty replay Me Usk of ebmrunti template heey, © ’ tua enagliikery Fe eubputt) coutec “Elemente af Me Lak ones"; for(int tzo, te betnge 5 +r) Devt ac tlement [Ee 8 cout ecendt; Lr: : Jat: Mnelsls thal ave sapracated a4 amas be Grated /irsbartaled wang Ie fallectog shaliroenli~ Canta a4 ue ol TL a = Crombie 700 SRE SE antag Hist ytd [eagiot< oes <3]? oe a Liness Lak roitte he ao Wibal copoly [asagist Dh a Linked Repreentabin , Mk elumanti oy o hak mog he Alotad oy any arbitrary Ack mienialy) Lacltzone 9” ee ee euvene, eu. fae butel acres list te Sue, erat ha on expbat paola (ay Lok dlocabioy Quy aclehew of Ike nent elurunt tn Wea Lk: 5 a tub au sled o> Br ay aitay Rep Conhgusa — eG Lintead Ath 9 Chains * Crculel, Linked slr i ee Linked Lish > Sh a bored Aeprerentabey , exch clumert of an bntteneaatigs dala object: is epracr tel ia > Eads rede Keaps explul tn conabiy alout tia Locals, of other Balevant rods oun Nhe Wea op oneltt nel Catled a. Lint coo peinle a) be Bin eon Uist cel) ot node - FI so es Go bkel Lu} vepresembeliny for lek Lak, each element @; exented in a Sepasalenede, § cothnot hs cy ob lon dag SSE waed Y teeale Nz ment element by IE oe a neath. , oe —Mede for &n_) harmo node bs im I, ie —Nowteble fisstnlede Local i BE Be finden 1 element indew = O © 2 inden glistsize eh Wee Ge Pret WeWyus ebonie Hosni ic:. trading J 1) decade tte faden—)" clonet 2) fret B new nook apter iE se on eee Lyk eleret shy dale fell —y element — hott Lan ‘ret in ee aE i template gclon TZ gktuct chainNode Eee \ ae ieee ! d ented £7 xe nent 5. — s acenenttttl a — & Te local Alien 4) .”* musth Steet at fusbnede —potlow Tha, prinl& 7 fustted ment node ie ts He Teas vil, Ca a —jollas orn mre pointer tg eis: Geet: Go tocale Rit ae! tina Harden 1 8 foltas a Syme Ff He Grodan, port byioning fusrslodes as Qh I above uprennis 4 ondjeeaeh ae mie eerentalcy hes enally ore Link Nay Staucliee wi tba & By et a lm emlst La Leore mores Cgr--- Coy) — EO Ee moc lao Chain: The Clan chain implrank Arent Lit as 0% Singly Linked tal Wadley Yr Thole Di eae mods has Ihe @) Lani o Une hsb 0 hats ete peinl Nuth- tay Fe ny template eclan T> Clem chen: public LinesrtsbeT > 2 publ: J) Const tuclon + chain (ink initial eapeclty = chain(corvt dusnet? 23 wehenhd5 1 Avr method book emp cork i Rela, Psi = Corub clo and dupes lie We)s 3 jot Sized cork E Relea Listes 3 Ie Got Hu Bride’) corse vind tndendtleornt TH Hatlerent) ae) Void erase (ink Na Grden) 5 void fast (ink We Fnden , ort Tk etl void outpat() cork 5 paetecked + } an Seles Holnedeeall If rep element in Kaeo i; aman 4 Wiskid be bled ov | 107 7 2°! ene — ™ anode aa : emu \ pe b net rt fesstode = nol P Jubwge °° : . port node ‘Mees By Clue «taut (i'd iva r cpt, Mit [fo] VN ‘ wuuk( i, 20) a dani) furrode fous ees & Listy ¥ iets ‘ 7 Neste > wore kaye . oe Ire 3ae . peo Pe Ss (4,25) @y pud_beurles) ‘i : [=| ae Listoye= 4 lena as —— sey ; thous! (as) seme teavene uple india-| ee ie “hastege—) dey pee OD pom ie goteue ast ge\) pointes Brenna uen lent prea) a ) » . rp Lines bist — Singly Loked finclude using namespace std? public. virtual { ~Linearbist () ) virtual bool empty()const=0; virtual int size()const=0; virtual Té get (int theIndex) const=07 virtual int indexof (const Té theElement) const=0+ virtual void erase (int theIndex)=0; virtual void insert (int theIndex,const Té the&lement)= virtual void output ()const=0; vemplate struct chainNode 4 T elements chainNode *next; chainnode () { y chainNode (const Té element) £ this->element=element; y chainNode (const Té element, chainNode* next) { this->element=element; this->next=next; ) a template class chain:public linearList {| | TE get (int therndex) const) const! | int" Indenoe conse. Te. ehokLonent int Wold erase (int theindex)/ ng che! | void insert (int theindex, com Yoid output () const jement) 7 Void push back(const Ts theBlem in bo pric poe. becks jpotneer|to #1000 tec 5 wba i jodes //P% : ‘ chainNode* firstWodes 5 Fe a | chain (4 jog int Listsize; M Paik template “Ghainet: chain) t Halse me! t ge if(listsize=-0) t 3 else t firstNode=NULb; GhainNode* sourceNode=theList. firstNode; iistNodernew chainNode (sourceNode->element) ; sourceliode=sourceNode->next; chainNode* targetNode=firstNode; hile (sourcenode!=wuLL) fargetNoce->next-ney chainNodecr> targetivode~ sourceNode: (sourceNode-> ‘targetNode->next; “sourceNode~snext, targetoae. ~>next=nurt, , ‘ . tepnatad Det tscelie — olelelar Ne modu of Uke chain ome by erie flees cachacn) Aagic: Aapeotedly delete IKE Hraitrmede Pe CLssehd eng, fn the dhe until NI emai , L if Vy jn gee — Bee Mea template Eomplatecssreget (int therndex) const palistsize) ‘ if (therndex<0| | therndex { curccnindex="* currentNode=firstNodes for(int i=0;ictheIndexs i++) ‘carrentNode=currentNode->next; return currentNode->element , i ee be iidlabe oo ges WO aa 9 ge 2 Ne rez Tad template ad unr] part pemplatecclss?, 7 xof (const Té theBlement)const faite" 217 jptede tee uate chainiodecr>* currentwode=firstNode: se eer ent int_inde: Complercty is dhhieTeursentNode!-wonn £5 currentNode-relement! wthetlenent) t currentNode=currentNode->next; indext+; ? if (currentNod: return -1; else return index? 3 ULL) template void chain::erase(int theIndex) { EDEN | theIndex>=listsize) ‘cout<<"; p ° "<<1i a eaeae <next; GeleteNode=p->nexti p->nextsdeleteNode->nex! \ H- Lstsize--; 6 delete deietevede ’ thezlement) x Wone chainctossinaert int tnezndex, const wots chainct>s inse 420) sy setcetnancaninerninovieti29) aes \ cout<<"Index="< (theELement, £375 ) tise i i chaintodecr>* postrstode7 for tine, t007ictherndex-1si60) Pepsnexts ponextenew chaintodecT> (theEiement P->next) 7 i Hatatzerss ' o(4sb3e) ) template void chain:: output () const. ra, achainNodecT>* currentNode-firstNode;currentNode! “NULL; currentNode=currentNode->next) cout<element<<* cout<::push back (const 7% theElement) GhainNodect>* petirse Nc for(int i50riclistsizeci sis) P=p->next; odes >t pafirstt f Bn i4+) cnainnodect for(int i Op i sly char ch="y"F while(ch=="y") 4 cout<<"1.Insert"<>choices switch (choice) { t<<"enter index and element to insert case 1: cou cin>>index>>ele; 11. insert (index, ele) ; break; cout<<"enter index to erase"<>index; sll.erase (index) 7 break: cout<<"enter index to get the element"<>index; cout<<"The element at index "<! sequence bared tak, OY — Bn Single Nobe aL: daat ee Pe ive fot = ote a ent Le > ee Pea. pe od oe 4 cay i hs elurunt fo ied hes bow a ae eet: dianok Na, SH pote ES Tol b a pole 4 ee ne L eh ge crate OR te a ta We separ ana ke tae Weds Poe gest | sy fo ey = | a el & a | ae: We set p ilat a ab i F 5 -Applicabent Can Bfler ee 4) fot a a) AAA ay A ht bl ~ husdrloda oer’) P! cout cP elerant 4 coubee p> deme ecerdls ne 3 Joa ee Ne - by Robe disli > A Dowty Livswed host d cack rede hee ren & present previnet viode cy ong) on tha Ly: eae arent necte Cy ang) on MWe onight Sing Linked best _ y enn Prout forte yp 4 “—jel= Davebty Linked hist © a 3 Poe] R ee a ee par Lestnoda Fiutnode a hen we dof’ Na cham for doubly Jannad isk» 06 tte Bee data membes —fasbNeds Ss dastnlode peink be Ie b-mast pome be 4 are wrodes of Ihe DLL no of Ihe > For on empty dob died disk, Pstteds = Lastrlode = rt ode = Lestlocke = > A DEL Wk jet Ay oe a een tg bet EAE os P. Prev newt fins trode ‘Lartrlode. elemele a nama piu = Ct, 213.4) (im (eRe Aurnod= Lostihode Linkad Lok 4 vsed, we qind ie trident ebarank by We when inden 2 Lateze [2 and ape te tyt ou 7 roe oe a oor a. z ke ants] putt claletont | pop? i eedines GE ae DW ee ees dh end & tolled Nie top Aam ends tol & called Mia boltern Place ob Ihe othu et F Ne —> Steck “Aer allows dyn, we or occ only elo > Te only ogee pes cba. is al top eM i ee “ep ee Pervoang DI Barmvec { + do stock Removing baat tType Stack Tinsdancer inne tit ¢ clement, A Bo ag0 + Patan tue } Styl): Relinn ro vag, Hi op? Pe Toe pop >: Remove IR a Oe pancaa: Au eet ™ om ond tia! ‘aul arene pet St Ye og Vistual TH ApOBill vinkial vod poptr =r inkual votd push (coat Pinte thatlerere ot I fe he top Bee? a tee a) ee ee “any Tope Sioa nora Enprowins Conwennen 3 type mpeeinionty pad on ee pate ay a op S peal a) free i Trp npror” ei Tope epatee Donde operands ore | & a +B i a pays Spe (Revese posh Hebation) — Th pats , opeuelan ds adh | . roe opt ope exales ee: o b+ y—& Pi op pele wenen Cpe Netaton > Pepe Sore Cero gemge eS ramp: pan oe abs oA * = pte a = gee aebeo con eapesrien ceoeeses I emperor on weed ; cae ae epee ot ae ’ rae ze cya ad ae * ee Zz : 2) Fird We te weed aye rp ae tee Gap & pottpa ernie Cow eti07 wy eS : sg eo 7 He Rend au te opt et : yen Inpa enpreair tls 2. 5 The foley! a . Jy Thee ey Hee Ratt] ootym ie tye per — poke ie divectly ere s au Le a. a 1y, ian PE ae ia) op oh * dhe Stack gts pl ee ar ‘{' is pel iy 4 a aap Way push decle eatept |, ed “4 combat Set result Tero 67 aba Je Pept ss pn HEE te tee a Tash! Peak BH wo & 7S a Pesyin Expreminn Cvolualiey [opesnds opal wig Sheek dadk Shanehiins au sir ae ve ie 4. Reod att the Symbols one by one fro { 5 ua stack py ewer Ian pwh err je 2 he oe pestfi™ op ypnbot us hx deere 2. H he Landing sy operand Cen : gyenboh uo operate a ¥ ne Kaolin sy eee oe 2 op and shore te tee PIP ‘ tee cand &) 1? pyjour rend Ty Variobles Cepoand 2 5, ope - les op a Von tat poy Sseeenel pepo an a POE bak y = sand spl te PPP dye Finally, popper & PP epent> py ; | fret Sa _svolue — = A (sae (8-2) aoe epee) Zz ce ee) (eee pulps exper is Rending eck Evaluate ' src ent (pat of poem, ? ie Shack 4 Soe ee op>= pop i rat Laboly Emyply op = FPO ad a t Nothing emit cpl oP ~eull pubtreult) @*) end of, arent = ppO iB del apa Z semll-= opt top> Jule | pushl emit) 2 Be) | al (s+3) of he of aa , oe] phe) FH re 1543) i supeo-e —4r wu Ip ut abt en *P iTaorats over obit BeplSsion wile (< sze) ie FP R = ‘ 1 my pusBYN Boer push) tp abt C exalin ab+ fp te, it(eh==9) ike post = Macopening pj while (oer t . postixi ft} Pho rf toy A aa = bP ab+cd } W ff the is {pepo te fpedhpreness ao PP opesalion om saboangeny pop Le eet ‘ 11 v0 saw an operator isomer) ( 1 sey gush he frat ‘pusnen ‘operator onto stack i eo {1 pop ofa the operator Ce lon 4 i append i tothe postfix expression tl 1 500 0n operator with 2 ower tan aent operator waite disempty() && stop! ak prone getPos 12°0)) strom the stack posthixfk++] = 5 1000: Jy pusn te current operator onto stack spushen ) , pop ofthe remaining opertors presentin the wok “and append ito post expression Ws (eemei0) “ postxnel= 81200: .pop() ) postfixik} = 0; // null terminate the postfix expression ) tnmain int maing { Iehar inf) ‘char infx(50}: ‘couts<"enter the infix expression"< Gy Queue ital bool empty) corst = 97 Vitliod int Sipe corvl 09 he PEPER fare cinc:, 1 ln Vithual Th backt) 20% Ie Viakaol void popl) =o? J] amore | ae 2 = to; He ae Viksot Void pus(trst TH Haeclement. a Me % eld youre u L Lente in P00 eta > Bueve dale shiuclitn OH be | dmg x empation [Jrplemertabcry 4 1 dung Repasentaty Herp 2 Licked Repeetentoli, ee rp ed fol aq Oey J “gg Sy Aves there He fe Ofer O- re hee | Sktcd in guene(t], 20. ps fe — be Ne Aaglts of Wie cota | Capacity af WE eter] gusesuePronk — herein = Locotirn of Iz Bonk clomank of Wl quame- gues Basch — Locatiin of Ika bach)veoe elerant of Wa guste. wy © >to pu an elerure + Gneraase pususback 4 Sanaa PE PEE = place new A ual 4 prensa back = ek ts ey jaar nee He y a) a ees eee) GS oy EH oe ree 4. Prrovgh te bel I bi element > ad elamarl | aod slide: the. on elerent , ap Ty eee BO es ee an . pee ee [9 os hy ta | 4 = poei=l= Piste) eee aad i thafaent tha Bach Buus 4 full Come) i ie - = qs [acpeliel COLE Hufront tte - qe Bed, oe connet tual eel aree nd no-ef Oe at poiliy ay ee) ears ae Bc toe Han eyl ote delim > y m Ws que eo Tei Une pee FG ovettarnn a Pe ag v ‘ yoo ale oho = v cade , s Viewed ov & SS . Sie peoton ie bushes snenk petitin of sea foment" © ts auayle gi) e at Baga, Wa beck re eee ; Peete pt ins pin © 7 In Crulor osreg snteat ing —funclicn: eo ae eee “iy ae ele / Bie wm FE es ey ey quot (03 03 3 23 cus CoD LSE Sd vac Se Le Lee YeBork -* jun nod oe 3 dhePrntso A full 8 KAR pop 3 Pe BSS is} eefetets OS Precdor Quuus Linked Peprestn ta bey Eh <¢ cage Sem peo’ * figtas eh Me tt Bef. ox. 2 pombe Pe D fen fet The back to oe po ps Dod pS Ae Hace the frent 2) frm bed lx | inclu using ‘temp class ¢ 4 publi 1 Rama ee lam Prograng t Aincludeciostream> using namespace st : templatecciass T> vt class queve.aet ‘ public: queve_ar(intntatepacity=30): bool emptylconst f return rear==-1| |front>rear; he size(}const A return listSize;, ta trnitementonst rt if{front==-1| |front>rear) ‘ coutee" undertow. | exit(t); ) else return queuelfront); ) 78 rearklement{}const { if(front==1||fronterear) return queuefrear]; void pop_front(); void display); ae Ee private: int front,rear,arraylength,listSize; T* queue; } ‘void push_back{const T &thetlement); . arraylengtheinitialcapactty; listSiz0=0;, queuesnew Tlarraylengthl 45 fronterear’ ) template void queue_arret>sipus thetlement) h_back(const T & t(rearexarraylength-1) coute<"Overflow"; else if(front==-1&&.rear==-1) { tone | eee te ‘queue[++rear}-theElement; 4 jude Be template vold queve_arr void queue_aret>ssplay) { iffronte= 86 rear==a)|| toot > vee) coutc<"Queve is empty"; conte sapupley' circularqueue_arr::circularqueue_arr(int fae Icapacity<0) ‘cout<<"Invalid capacity’; else { arraylength=initialcapacity; listSize-0; ‘queue=new Tlarraylength]; front=rear=0; ope nar Chktulan Castae. Of Crabiors hing aise ae © gare(roars1)%arraylength queuo(rear}=theElement; list Sizer; d d template void circularqueue_arr:;pop_front() 4 itront==rear) ‘cout<<"Underflow...cannot pop element from queue"<::display() { if(front==rear) cout<<"Queue is empty"<front) { for(int i=(front+1);i<=rearj++) cout<rear) for(int ix(front+1);i<=arraylength-1;i++) cout< (4); poet wo weteh==¥) ‘ease §: coutceNo ‘f elements in the queue are : "<*next cehainNode()) SRainNode(const T& ekement) { peocdeentatent ) 2 ainnode(const T& element.chalt inNode*next) queve_sil0; bool empty()const { return rear==NULL; 1 int size()eonst { return listSize; 1 void push_back{const T &theElement); void pop_front(); void display(); private: ‘chainNode *front,*rears int listSize; ee engl renege opeatiers men Cee Lokad Aaprorerbote we as const T & thetlement) e@ wing templateccass 7 Void queue. sieT™ push back! i iirear=eNULL) ( rearenew chainnodecT=(th@l front’ ) else ‘ chainNode(theelemer ponent) ferment, HULL): at new nt, NULL); listSize++s d templatecclass > tary queue_siicT>spop sone) if(front==NULL) coute<"under flo} else sdeleteNode=fronts ywiecendl; { chainNode ii{front==rea) rear-front->next; front=front->nexti delete deleteNode; o) else 4 front=front->next; delete deleteNode; y listSize—y } 1 template void queue_siir:display() 5 sixe" ® Nenvene.dlteT> dequeue, AIK) By Nose) chair (const T& element) 4 this>element=element; : chainNode(const TR element.chainNode*next.chainNode*prev) public: ‘dequeue_dllQ; ‘bool empty()const t ‘return rear—=NULL: y int sizeQconst t ‘return dqSize; e } T frontElement()const { return front>element; {TrearElement(Qconst return rear->element; ese 0 1 sd push_back(const T theBlement); ‘void pop_front(); template tem cucu AlIsipush_back(const T theElement) ( if(rear=NULL) ( rear=new chainNode(theElementNULL,NULL front=rear, else { chainNode *p=new chainNode(theElement. NULL,tear) rear->next=P; rear=pi dgSize++; y template void dequeue_dll::pop_front) { if{front==NULL) ‘cout<<"under flow"<next; front->prev=NULL; dqSize—; y + template void dequeue_dll::pop_back() 3 { if{front=-=NULL) ‘cout<<"under flow"< TSid dequeve Atl display 0 int main) © sequeue_dit da_il: char ch=Y, while t A ecethinsert"<>eles dq_dil.push_back(ele); break; cease 2: dq_all.pop_front(); ‘cout<<"front element deleted"<>chs 5 return 0: d

You might also like