#include <iostream>

Include dependency graph for build_list_forward.cpp:

Classes
struct	Node

Functions
int	main ()

void	print_list (Node *head)

void	tail_insert (Node &head, Node &tail, int num)

Function Documentation

◆ main()

int main ( void )

Definition at line 42 of file build_list_forward.cpp.

{
    Node * head = NULL, * tail = NULL;
    int num = 0;
 
    // build linked list backward
    cout << "input integers (-999 to end): ";
    cin >> num;
    while ( num != -999 ) {
        tail_insert(head, tail, num);
        cin >> num;
    }
 
    // print the items in the linked list
    print_list(head);
 
    return 0;
}

References print_list(), and tail_insert().

Here is the call graph for this function:

◆ print_list()

void print_list ( Node * head )

Definition at line 11 of file build_list_forward.cpp.

{
    Node * current = head;
    while (current != NULL)
    {
        // process the current node, e.g., print the content
        cout << current->info << " -> ";
        current = current->next;
    }
    cout << "NULL\n";
}

References Node::info, and Node::next.

Referenced by main().

Here is the caller graph for this function:

◆ tail_insert()

void tail_insert	(	Node *&	head,
		Node *&	tail,
		int	num )

Definition at line 23 of file build_list_forward.cpp.

{
    Node * p = new Node;
    p->info = num;
    p->next = NULL;
 
    if (head == NULL) {
        head = p;
        tail = p;
    }
    else {
        tail->next = p;
        tail = p;
    }
}