void remove_last()
{
node *t = head;
t = t->next
if (t->next->next == NULL)
{
}
}
void display()
{
node *t = head;
while (t != NULL)
{
printf("(data=%d ", t->data);
printf("age=%d)", t->age);
printf(" -> ");
t = t->next;
}
}
public void add_element(int element)
{
node new_node = new node();
new_node.data = element;
new_node.next = null;
if (head == null)
{
head = &new_node; tail = &new_node;
}
else
{
print(head->data);
(*tail).next = &new_node;//or tail->next = &new_node;
tail = &new_node;
}
len++;
}
void add_uninode(int num, int age)
{
//check if list is empty
if (head == NULL)
{
node *t = new node;
t->data = num;
t->age = age;
t->next = NULL;
head = t;
tail = t;
}
else
{
node *t = new node;
t->data = num;
t->age = age;
tail->next = t;
tail = t;
t = t->next;
}
}
public linked_list()
{
this.head = null;
this.tail = null;
}
