Question

This exercise is to exam the dynamic behavior of the working pointers the following Methods:

• Add(item) and Remove(item) for LInkedQueue
• push(item), pop(item) and top() for LinkedStack

Place an A4 paper in landscape orientation, draw the illustration on the left half and write the corresponding C++ code directly to its right. The main focus of the Illustration is to show the relationship between the list elements with the working pointers in the program.

Group your illustration in (test) scenarios of

1. empty Linked Container;
2. one item Linked Container;
3. more than one-item Linked Container.

Use the illustrated convention to present the class for pointer movement, modification, and end of list.

Answer 1

Following are the illustration and corresponding c++ codes of the mentioned functions:

( Note: As the illustration were too large to be fitted on a single page illustration for "Add(Item) for more than one item list" is done on a separate page, rest of the functions are on single page) :

inked Queue 1) Additem) Ct+ Cod Llustration ) Empty Linted Container initial stale: != NULL)//re, there w smu |value llavailalble in memon NULL n1자 temb- value- ke tem l Case 1: Ev- Alter Addin 나. * rear NULL) eor NULL i) one Jtem Linked container : Il ca se 2: One Ttem II Cae 3 More Than One I tem ro value Ear next nex rear> ne atter Adding Yeur valve temp-> next NULL en 2 tune NULL

111〉 Add Item for More than 0ne tem linked Container: Illustration inital ront recr Value Yaulut neu. item 1 Value nex NULL 1em item 2 Hter Addi na Teclr Valuii value next next |ーーぅ! neth next NULL ulcunn

Kemovc1tem for inkd Cveue inked Contruiner lfronH_추NUIL nothing to Remor Ilcaue 1 Crear NULL) 2) one Item inked container uturn ron Value next de rear AOY Rumore: ltront NULL (나cm2.us dilekd) cae 2 rear icate i else i 3) Mar Than One Itm Uinked ontainer ya rear nexp iti Ater Remore: free Ctomp Vear itz

linked Sack Iustration C Code rush ( node xx top, unt key) ) posh (item) i) Empt^ linked Container 饈 NULL ASter Push' to lcase 1 nexh eloil Alter puh: nex3.tーナNULL tem Val Val

Linkea Stack 5 2) pop Ciuem (1) Empty 나 pop (nodeそ tar ) NULL . underflow error 41) One Itan it: ィ Cout << ,, under Row" . tob |--) | Val Aer ii) More Than One Item List: Val free temp); noeh lem →| next ittn 2 Attr ilemn Cahun JA deleted)

opfrinked Stack aid top C node.ギtop) ( t op = NULL ) return eliet ( print to -) val ) ) Mort an One 1 lem lis+ Val Vol