#ifndef _LIST_H
#define _LIST_H

#include "node.h"                          // list relies on node to work

struct list {
    Node              *lead;               // pointer to start of list
    Node              *last;               // pointer to end of list
};

code_t  mklist (List **);                  // create new list struct
code_t  cplist (List  *, List **);         // duplicate list contents

code_t  insert (List **, Node *, Node  *); // add node before given node
code_t  append (List **, Node *, Node  *); // add node after given node

code_t  display(List  *, int);             // display list start to end
code_t  find   (List  *, char,   Node **); // locate node with value

#endif