list class

Function Parameter(s) Return value
search(int value) int value bool

insert(Node *)

Function Parameter(s) Return value
insert(int value) int value bool

Overloaded function (Node *, Node* location)

PATH: ../backgammon/list 
myList.insert(INT, NODE*);
Function Parameter(s) Return value
insert(int, Node*) int, Node* bool

Overloaded function (int value, Node* location)

Function Parameter(s) Return value 
myList.insert(value, tmp);

append()

Function Parameter(s) Return value
append(node, *location) node, *location bool
Brief Description Inserts a node after a given location in the list

append(value)

appending a value involves inserting a node with a value after the program finds the wanted node and then puts the new node with the value after it. 

myList.append(value);
Function Parameter(s) Return value
append(int) value to insert into node bool value of success

append(Node *)

append(Node *) will add a node to the end of the list or if the list is empty create the list 

myList.append(tmp);
Function Parameter(s) Return value
append(Node *) node pointer to location of node to insert bool value of success vs failure

delete(Node *)

Function Parameter(s) Return value
deleteNode() int value bool