Managed C++/CLI

<br />
<br />
struct Node<br />
{<br />
	int data;<br />
	Node *next;<br />
	Node *prev;<br />
};<br />
<br />
class BasicList<br />
{<br />
public:<br />
	/* CONSTRUCTORS / DESTRUCTORS */<br />
	BasicList();						// Default Constructor<br />
<br />
	/* INSERTION METHODS */<br />
	void Prepend(int n);				// Insert n into list as the first item<br />
	void Append(int n);					// Insert n into list as the last item<br />
	void InsertAfter(int key, int n);	// Insert n into list after key<br />
	void InsertBefore(int key, int n);	// Insert n into list before key<br />
	void Swap(int first, int second);	// Swap specified elements<br />
	void Remove(int key);				// Remove first occurance of key from list<br />
<br />
	/* QUERY METHODS */<br />
	void DisplayNodes() const;			// Display the data item from each node in the list<br />
	bool IsEmpty() const;				// Return true if the list is empty<br />
	int  Maximum() const;				// Return the largest member in the list<br />
	int  Minimum() const;				// Return the smallest member in the list<br />
	int  Occurances(int key) const;		// Return the number of occurances of key<br />
	int  NumNodes() const;				// Return the number of nodes in the list<br />
<br />
	/* HELPER FUNCTIONS */<br />
	Node *GetAddress(int n);			// Returns the address of the first instance of n found in list<br />
	int  *GetDataArray();				// Return a pointer to an array containing the data.  Last item in array is NULL<br />
<br />
private:<br />
<br />
	/* MEMBERS */<br />
	Node *head;							// pointer to empty head node<br />
	Node *tail;							// pointer to empty tail node<br />
};<br />
<br />