problem with AVAIL

[Jessica Arora]

Write your question here.

 #include<iostream>
#include<conio.h>
using namespace std;
struct node
{
    int data;
    node *next;
};
typedef node *list;
void ins_beg(list, int, list);
list head, AVAIL;
int main()
{
    int dat, item;
    char ch;
    list temp;
    head=NULL;
    cout<<"Do you want to enter data??"<<endl;
    cin>>ch;
    while(ch=='y' || ch=='Y')
    {
        cout<<"Enter data"<<endl;
        cin>>dat;
        temp=new node;
        temp->data=dat;
        temp->next=head;
        head=temp;
        cout<<"Enter more data??"<<endl;
        cin>>ch;
    }
    cout<<"Do you wish to insert any node at beginning?"<<endl;
    cin>>ch;
    while(ch=='y'|| ch=='Y')
    {
        cout<<"Enter data"<<endl;
        cin>>item;
        ins_beg(head, item, AVAIL);
        cout<<"Do you wish to insert more items at beginning?"<<endl;
        cin>>ch;
    }
    return 0;
}

void ins_beg(list head, int item, list AVAIL )
{
    if(AVAIL==NULL)
    {
        cout<<"Overflow !!! CAN'T INSERT"<<endl;
    }
    AVAIL=new node;
    AVAIL=AVAIL->next;
    AVAIL->data=item;
    head=AVAIL;
    return;
}

[Chervil]

Is there a particular question or problem regarding the above code?

[Jessica Arora]

dere is some logical problem in ins_beg function.....please help me

[Chervil]

I think to insert at the beginning, the function requires only two parameters, the head of the list, and the data value. Perhaps something like this:

void ins_beg(list & head, int item)
{
    list AVAIL = new node;
    AVAIL->data = item;
    AVAIL->next = head;
    head = AVAIL;
}

Note head is passed by reference as it will be modified by this function.