Hello,
I have small/big problem: how to implement Linked List inside Linked List...
Code:
struct TList1
{
int value;
TList1 * next;
};
typedef TList1 * wskList1;
struct TList2
{
int value;
wskList1 list; /* List inside List */
TList2 * next;
TList2 * prev;
};
typedef TList2 * wskList2;
I am looking for a piece of code: Add and Delete elements in List1, which is part of List2.
My rubbish:
Code:
wskList2 AddR( wskList2 &Beg, wskList2 &End, wskList2 &Elem )
{
Elem->next = NULL;
if ( Beg == NULL )
{
Beg = Elem;
Elem->prev = NULL;
Beg->list = NULL;
}
else
{
Elem->prev = End;
End->next = Elem;
}
End = Elem;
return Beg;
}
wskList1 AddRev( wskList1 &Beg, wskList1 &Elem )
{
if ( Beg == NULL )
{
Beg = new TList1;
Beg = Elem;
Beg->next = NULL;
}
else
{
Beg->next = Elem;
Elem->next = NULL;
}
return Beg;
}
//........
wskList2 x;
x->list = AddRev( x->list, RevElement )
... it doesn't work properly ;(
Help Me!