print_list_reverse.cpp File Reference

#include <iostream>

Include dependency graph for print_list_reverse.cpp:

Go to the source code of this file.

Classes
struct	Node

Functions
int	main ()
void	print_list (Node *head)
void	print_list_reverse (Node *head)
void	tail_insert (Node *&head, Node *&tail, int num)

Function Documentation

main()

int main

(

void

)

Definition at line 52 of file print_list_reverse.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
    cout << "print list in order: " << endl;
    print_list(head);
 
    // print the items in the linked list in reverse
    cout << "print list in reverse: " << endl;
    print_list_reverse(head);
 
    return 0;
}

References print_list(), print_list_reverse(), and tail_insert().

Here is the call graph for this function:

print_list()

void print_list

(

Node *

head

)

Definition at line 21 of file print_list_reverse.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:

print_list_reverse()

void print_list_reverse

(

Node *

head

)

Definition at line 11 of file print_list_reverse.cpp.

{
    if (head == NULL)
        cout << "NULL";
    else {
        print_list_reverse( head->next );
        cout << " <- " << head->info;
    }
}

References Node::info, Node::next, and print_list_reverse().

Referenced by main(), and print_list_reverse().

Here is the call graph for this function:

Here is the caller graph for this function:

tail_insert()

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

Definition at line 33 of file print_list_reverse.cpp.

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

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

Referenced by main().

Here is the caller graph for this function: