C / C++ / MFC

int records::InsertNode(char m_last_name[], char m_first_name[], long m_ssan)
{
	ListNode *NewNode, *NodePtr, *PreviousNode;

	// Allocate a new node & store values
	NewNode = new ListNode;
	strcpy(NewNode->last_name, m_last_name);
	strcpy(NewNode->first_name, m_first_name);
	NewNode->ssan = m_ssan;
	
	// If there are no nodes in the list
	// make NewNode the first node
	if (!Head)
	{
		Head = NewNode;
		NewNode->Next = NULL;
	}
	else	// Otherwise, insert NewNode at end
	{
		// Initialize NodePtr to head of list
		NodePtr = Head;
		

		<font color="red">PreviousNode = NodePtr;</font>

		// Skip all nodes whose Value member is less
		// than m_ssan.

		while (NodePtr != NULL && NodePtr->ssan < m_ssan)
		{	
			PreviousNode = NodePtr;
			NodePtr = NodePtr->Next;
		}

		// Insert the node after the one pointed to
		// by PreviousNode and before the one pointed to
		// by NodePtr.
		PreviousNode->Next = NewNode;
		NewNode->Next = NodePtr;
	}
	return 0;
}

Unhandled exception at 0x0046a470 in StackTest.exe: 0xC0000005: Access violation reading location 0x00000000.

StackTest.exe!strlen() Line 78 Asm
StackTest.exe!exception::exception(const exception & that={...}) + 0x31 C++
StackTest.exe!std::bad_alloc::bad_alloc(const std::bad_alloc & __that={...}) + 0x13 C++
StackTest.exe!std::_Nomemory() Line 8 + 0xd C++
StackTest.exe!operator new(unsigned int size=240) Line 15 C++
StackTest.exe!operator new[](unsigned int count=240) Line 7 + 0x9 C++
StackTest.exe!CStack<int,30>::resize(unsigned int nNewSize=60) Line 75 + 0xc C++
StackTest.exe!CStack<int,30>::push(int & tData=8) Line 26 C++
StackTest.exe!main() Line 33 C++
StackTest.exe!mainCRTStartup() Line 259 + 0x19 C
kernel32.dll!GetCurrentDirectoryW() + 0x44

template < typename T, int INCREMENT ><br />
void CStack< T, INCREMENT >::resize( size_t nNewSize )<br />
{<BLOCKQUOTE>// Make sure the new size is valid<br />
	if ( nNewSize == m_nCapacity )<br />
		return;<br />
	else if ( nNewSize < INCREMENT )<br />
		nNewSize = INCREMENT;<br />
<br />
	T		*pNewStack;		// Pointer to the new stack<br />
	size_t		nMinSize;		// Minimum copy size<br />
<br />
	nMinSize = nNewSize < m_nCapacity ? nNewSize : m_nCapacity;<br />
<br />
	// Allocate the new stack<br />
	pNewStack = new T[ nNewSize ];<br />
	<br />
	// Move the old data into the new stack<br />
	memmove( pNewStack, m_pStack, nMinSize*sizeof(T) );<br />
<br />
	// Deallocate the old stack<br />
	delete [] m_pStack;<br />
<br />
	// Point to the new stack<br />
	m_pStack = pNewStack;</BLOCKQUOTE>}