Reply to thread

Message: <blockquote data-quote="san**" data-source="post: 14610419" data-attributes="member: 392854">Defining singly linked list#include <iostream.h>#include <conio.h>struct NodeType{int number;NodeType *next;};int main(){NodeType *head, //pointer to point to the first node*current, //pointer to keep track of pos in list*tmp; //pointer used to display listchar answer;head = new NodeType; //create the first node & makecurrent = head; //head and current point to it(*current).next = NULL;clrscr();do //populate the list{cout << "Enter an integer ";cin >> (*current).number;cout << "add another node? ";cin >> answer;if(answer == 'Y' || answer == 'y'){(*current).next = new NodeType; //create new nodecurrent = (*current).next;(*current).next = NULL; //make last node the tail}}while(answer == 'Y' || answer == 'y');tmp = head;while (tmp != NULL) //display the list{cout << (*tmp).number << " ";tmp = (*tmp).next;}return 0;}stacks# include <iostream.h>const int MAX_STACK_SIZE = 5;class Stack{        public:            Stack();        // default constructor            ~Stack();        // destructor            bool isEmpty();            bool isFull();            Type top();            void push(Type n);            void pop();            int size();        private:            struct Node            {                Type data;                Node* next;            }            Node* currPtr;            int sizeOf;        // number of items}Stack:Stack()        // constructor{        sizeOf = 0;}Stack::~Stack()        // destructor{        while ( !( isEmpty() ) )        {            pop();        }}bool Stack::isEmpty()        {        return ( sizeOf == 0 );}bool Stack::isFull()        {        return ( sizeOf >= MAX_STACK_SIZE );}Stack::top(){        assert ( !isEmpty() );        return (*currPtr).data;}int Stack::size(){        return sizeOf;}void Stack:<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite7" alt=":p" title="Stick out tongue    :p" loading="lazy" data-shortname=":p" />ush( Type n )        {        assert ( !isFull() );        Node* newItem = new Node;        (*newItem).data = n;        (*newItem).next = currPtr;        currPtr = newItem;        sizeOf++;}void Stack:<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite7" alt=":p" title="Stick out tongue    :p" loading="lazy" data-shortname=":p" />op(){        assert ( !isEmpty() );        Node* temp = currPtr;        currPtr = (*temp).next;        delete temp;        sizeOf--;}void display ( Stack& s )        {        Stack temp;        while( (!s.isEmpty() ) )        {            cout << s.top() <<‘,’ ;            temp.push( s.pop() );            s.pop();        }            while( (!temp.isEmpty() ) )        {            s.push( temp.pop() );            temp.pop();        }}void main()         {    Stack myIntStack;    int num = 1;    while( !(myStack.isFull() ) )    {        cout << “Pushing “ << num << <<myIntStack.push(num);        num++;        display(myIntStack);        cout << endl;    }while( !(myIntStack.isEmpty() ) )    {        cout << “Popping “ << myIntStack.top();        myIntStack.pop();        cout << “ : ” ;        display(myIntStack);        cout << endl;      }}Queuesclass Queue {private:  struct NameRec   {    char name[MAXCHARS];    NameRec *nextaddr;  };  NameRec *queue_in;  NameRec *queue out;public:  Queue(void);  void enqueue(char *);  char *dequeue(void);  int isEmpty(void);};Queue::Queue(void) {  queue_in = NULL;  queue_out = NULL;}void Queue::enqueue(char *newname) {  NameRec *new_addr;  new_addr = new(NameRec);  if (new_addr==NULL) {    cout << “No more memory” << endl;  else {    strcpy(new_addr->name, newname);    new_addr->nextaddr = NULL;    if (queue_in!=NULL)        queue_in->nextaddr = new_addr;    if (queue_out==NULL)        queue_in = new_addr;  }  return;}char *Queue::dequeue(void) {  NameRec *temp_addr;  char name[MAXCHARS];  strcpy(name, queue_out->name);  temp_addr = queue_out->nextaddr;  delete(queue_out);  queue_out = temp_addr;  return name;}int Queue::isEmpty(void) {  if (queue_out ==NULL) return true;  else return false;}int main() {  char Newname[MAXCHARS];  Queue namequeue;  cin.getline(newname,MAXCHARS);  namequeue.enqueue(newname);  ….  while (!namequeue.isEmpty())   {    strcpy(newname, namequeue.dequeue());    cout << newname << endl;  }  return 0;}language-C++</blockquote>

Verification: Hata thunen beduwama keeyada? (60 bedeema thuna)

Top Bottom