{ cout << Main Menu”; ”ntt cout << Addition of Queue”; ”nt1. cout << Deletion from Queue”; ”nt2. cout << Traverse of Queue”; ”nt3. cout << Exit from Menu”; ”nt4. cout << Enter your choice from above”; ”nn cin >> choice; switch (choice) { case 1: do { QUEUE.add_Q(); cout << you want to add more element < Y/N > ?”; ”nDo cin >> opt; } while(toupper(opt)==’Y’); break; case2: opt =’Y’;
{ cout << ”ntt Main Menu”; cout << ”nt1. Addition of Queue”; cout << ”nt2. Deletion from Queue”; cout << ”nt3. Traverse of Queue”; cout << ”nt4. Exit from Menu”; cout << ”nn Enter your choice from above”; cin >> choice; switch (choice) { case 1: do { QUEUE.add_Q(); cout << ”nDo you want to add more element < Y/N > ?”; cin >> opt; } while(toupper(opt)==’Y’); break; case2: opt =’Y’;
1780312599datastructure_questions.docx