1- define a struct node that has the following info:
node*next , value (int)
2-define an Queue class as linked list that has the following info:
private: node*root,public:function empty,and full, and add, and delete
3-in void main you ask user the following:
enter 1 if you need to add values
enter 2 if you need to delete value
enter 3 if you need to print but if you delete value you must undo and print value
Comments
Leave a comment