build_list_sorted.cpp File Reference

#include <iostream>

Include dependency graph for build_list_sorted.cpp:

Go to the source code of this file.

Classes
struct	Node

Functions
void	delete_head (Node *&head)
void	delete_list (Node *&head)
void	delete_node (Node *after)
Node *	find (Node *head, int num)
Node *	find_prev (Node *head, int num)
int	get_option ()
void	head_insert (Node *&head, int num)
void	insert (Node *after, int num)
int	main ()
void	option_delete (Node *&head)
void	option_insert (Node *&head)
void	print_list (Node *head)

Function Documentation

delete_head()

void delete_head

(

Node *&

head

)

Definition at line 75 of file build_list_sorted.cpp.

{
    if (head != NULL) {
        Node * p = head;
        head = head->next;
        delete p;
    }
}

References Node::next.

Referenced by delete_list(), and option_delete().

Here is the caller graph for this function:

delete_list()

void delete_list

(

Node *&

head

)

Definition at line 135 of file build_list_sorted.cpp.

{
    while ( head != NULL )
    {
        delete_head(head);
        print_list(head);
    }
}

References delete_head(), and print_list().

Referenced by main().

Here is the call graph for this function:

Here is the caller graph for this function:

delete_node()

void delete_node

(

Node *

after

)

Definition at line 86 of file build_list_sorted.cpp.

{
    Node * p = after->next;
    after->next = p->next;
    delete p;
}

References Node::next.

Referenced by option_delete().

Here is the caller graph for this function:

find()

Node * find	(	Node *	head,
		int	num )

Definition at line 61 of file build_list_sorted.cpp.

{
    Node * current = head;
 
    while (current != NULL) {
        if (current->info == num)
            return current;
        else
            current = current->next;
    }
 
    return NULL;
}

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

Referenced by option_delete().

Here is the caller graph for this function:

find_prev()

Node * find_prev	(	Node *	head,
		int	num )

Definition at line 43 of file build_list_sorted.cpp.

{
    if (head == NULL || head->info >= num )
        return NULL;
 
    // at least one node in the list now
    Node * current = head;
 
    while (current->next != NULL) {
        if (current->next->info >= num)
            return current;
        else
            current = current->next;
    }
 
    return current;
}

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

Referenced by main(), option_delete(), and option_insert().

Here is the caller graph for this function:

get_option()

int get_option

(

)

Definition at line 93 of file build_list_sorted.cpp.

{
    int c;
    cout << endl << "enter option (1: insert; 2: delete; 0: quit) ";
    cin >> c;
    return c;
}

Referenced by main().

Here is the caller graph for this function:

head_insert()

void head_insert	(	Node *&	head,
		int	num )

Definition at line 23 of file build_list_sorted.cpp.

{
    Node * p = new Node;
    p->info = num;
    p->next = head;
    head = p;
}

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

Referenced by main(), and option_insert().

Here is the caller graph for this function:

insert()

void insert	(	Node *	after,
		int	num )

Definition at line 33 of file build_list_sorted.cpp.

{
    Node * p = new Node;
    p->info = num;
    p->next= after->next;
    after->next = p;
}

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

Referenced by main(), and option_insert().

Here is the caller graph for this function:

main()

int main

(

void

)

Definition at line 144 of file build_list_sorted.cpp.

{
    Node * head = NULL, * after_this;
    int num = 0;
 
    // build sorted linked list
    cout << "input integers (-999 to end): ";
    cin >> num;
    while ( num != -999 ) {
        after_this = find_prev(head, num);
 
        if (after_this == NULL)
            head_insert(head, num);
        else
            insert(after_this, num);
 
        print_list(head);
 
        cin >> num;
 
    }
 
    int c;
    while (c = get_option()) {
        switch (c)
        {
        case 1:
            // insert a node
            option_insert(head);
            break;
        case 2:
            // delete a node
            option_delete(head);
            break;
        }
        print_list(head);
    }
 
    delete_list(head);
 
    return 0;
}

References delete_list(), find_prev(), get_option(), head_insert(), insert(), option_delete(), option_insert(), and print_list().

Here is the call graph for this function:

option_delete()

void option_delete

(

Node *&

head

)

Definition at line 114 of file build_list_sorted.cpp.

{
    int num;
    cout << endl << "number to delete: ";
    cin >> num;
 
    Node * p = find(head, num);
 
    if (p == NULL) {
        cout << "item not found!" << endl;
    }
    else {
        // find the previous node, so that we can delete
        p = find_prev(head, num);
        if (p == NULL)
            delete_head(head);
        else
            delete_node(p);
    }
}

References delete_head(), delete_node(), find(), and find_prev().

Referenced by main().

Here is the call graph for this function:

Here is the caller graph for this function:

option_insert()

void option_insert

(

Node *&

head

)

Definition at line 101 of file build_list_sorted.cpp.

{
    int num;
    cout << endl << "number to insert: ";
    cin >> num;
 
    Node * after_this = find_prev(head, num);
    if (after_this == NULL)
        head_insert(head, num);
    else
        insert(after_this, num);
}

References find_prev(), head_insert(), and insert().

Referenced by main().

Here is the call graph for this function:

Here is the caller graph for this function:

print_list()

void print_list

(

Node *

head

)

Definition at line 11 of file build_list_sorted.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 delete_list(), and main().

Here is the caller graph for this function: