Lists within Lists or Nested Linked Lists...

[Coder_rick@yahoo.com (Coder87c)]

Hello everyone, i been a Ada programmer in college for about 8 months
now.

Right now we are doing Lists within Lists or Nested Linked Lists I
cant decided which name is right.

Dont worry I wont be asking for anyone to do my work for me, Im just
tottaly baffled.

So I got something like this...

TYPE TaskNode;
   TYPE TNodePtr IS ACCESS TaskNode;
   TYPE TNode IS RECORD
      Name             : Positive;
      Work             : Natural;
      Worked           : Natural;
      Next             : TNodePtr;
   END RECORD;

   TYPE PNode;
   TYPE Scheduler IS ACCESS PNode;
   SUBTYPE PNodePtr IS Scheduler;
   TYPE PNode IS RECORD
      Number           : Positive;
      TDone            : Natural;
      TLeft            : Natural;
      head             : TNodePtr;
      tail             : TNodePtr;
      Next             : PNodePtr;
   END RECORD;


So basically if the program was complete the user could assign a
number like

1 and have its Tdone be 5 and Tleft be 4

Then the user could assign another number like 

5 and have its Tdone be 3 and Tleft be 10

It cant keep creating diffrent Numbers and assigned it Tdones and
Tlefts.

It can also take awwy Tdones..

Now my problem is... How do I simply assign start?  

Like how would a function look like just to assign a number to number?
 With no Tdones or Tlefts?

Right now I got something like this

  A := new Pnode'(Number,0,0,NULL,NULL,NULL);

but this assigns Pnode to something and when I recall it just erases A
and replaces it with the new thing.

Sorry if this is unclear.