data structers

[Bassam300]

hi
this code it is for union two dynamic lists

#include <string>
#include <sstream>
#include <iostream>

using namespace std;

struct list
{
    int data;
    list *next;
};


int main()
{
    list *head = NULL, *tail = NULL, *node;
    string input;
    int num;

    cout << "\nAdding values to the first dynamic list :\n";
    while(true)
    {
        cout << ">>";
        cin >> input;

        if(istringstream(input) >> num)
        {
            node = new list;
            node->data = num;

            if(head == NULL)
            {
                head = node;
                tail = node;
            }

            else
            {
                tail->next = node;
                tail = node;
            }


        }

        else
            break;
    }

    cout << "Adding values to the second dynamic list :\n";
    while(true)
    {
        cout << ">>";
        cin >> input;

        if(istringstream(input) >> num)
        {
            node = new list;
            node->data = num;
            tail->next =node;
            tail = node;
        }

        else
            break;
    }

    return 0;
}

I have studied this method in the university, but I feel that this method is not good for programmers Is there any other way to write such a program by better way?

sorry for my bad english

[Nexius]

No, it's terrible design. The university should have taught encapsulation and Object Oriented design.
Here's some simple code to get you started with an abstract container.

#ifndef NULL
#define NULL 0
#endif
template<typename T>
struct list_t
{
	//type
	struct node
	{
		//data
		T data;
		node *pred;
		node *succ;
		node() : pred(NULL), succ(NULL)
		{
		}
	};

	//data
	node *head;
	node *tail;
	//constructors/overload functions
	list_t() : head(NULL), tail(NULL) //constructor
	{
	}
	list_t(const list_t &source)
	{
		//fill this out
	}
	list_t & operator = (const list_t &source) //assignment operator
	{
		//fill this out
	}
	~list_t() //destructor
	{
		//fill this out
	}
	
	//methods
	void push_back(T const &source)
	{
		node *part= new node;
		part>pred= tail;
		((head)? tail->succ : head) = part;
		tail= part;
	}
	void push_front(T const &source)
	{
		node *part= new node;
		part->succ= head;
		((tail)? head->pred : tail) = part;
		head= part;
	}	
};

[Bassam300]

thank you very much Nexius!

plz add the main part to your code, cuz i didn't understand it very well

sorry for my bad english