deleting 2D LinkList completely

Isthere any problem int the code (for deleting 2D LinkList completely) given below?

Code:

void CDataStructure::Destroy(void)
{
	Node *traverseN = new Node();
	Node *tempN     = new Node();
	Edge *tempE     = new Edge();
	Edge *traverseE = new Edge();

	if(Node_Head != NULL)
	{
	traverseN = Node_Head;

	while(traverseN != NULL)
	{
		if(traverseN->Link != NULL)
		{
			traverseE = traverseN->Link;

			while(traverseE != NULL)
			{
				tempE = traverseE;
				traverseE = traverseE->Next;
				delete tempE;
			}
		}

		tempN = traverseN;
		traverseN = traverseN->Next;
		delete tempN;
	}
	}

}

Expecting right answer specially from (Code Master )Elysia

*Moved to new thread*

Originally Posted by DeadlyWarrior

Isthere any problem int the code (for deleting 2D LinkList completely) given below?

You have memory leaks. As for correctness of the deletion itself: some may be able to guess what exactly you are trying to do, but for the less enlightened among us, it would help if you provided some background of what you are doing, perhaps also providing the relevant class definitions.

A minor point is this:

Code:

	
if(Node_Head != NULL)
{
   traverseN = Node_Head;
   while(traverseN != NULL)
   {

Why check Node_head of being NULL? You do that since you assign Node_head to traverseN and then check the later for being NULL. There is no harm done assigning Node_Head to traverseN if it is NULL, so this is pointless. Just delete the if statement completely.

[QUOTE=laserlight;912473]*Moved to new thread*


I Have these two structs in one class may be this would help you in understanding the problem

Code:

struct Edge
	{
	CString Linked_MAC;
	int     Weight;

                Edge   *Next;  

	}*Edge_Head;

          struct Node
	{
	CString MAC_Address;
	Edge   *Link;

	Node   *Next;
        
	}*Node_Head;