Separate Chaining Hash Table

[nightmaregiba]

anything wrong in my insert() function
Hope someone help!

template <class T>
class Node
{
public:
	T key;
	Node* next;
};

template <class T>
class Bucket
{
public:
	Node<T> * head;
	int count;
	Bucket()
	{
		head = NULL;
	}
};

template <class T> 
class HASH_TABLE 
{
private:
	Bucket<T> *items; 
	int maxSize; 
public:
	HASH_TABLE(int size, char* FileName); 
	int HashFunction(T key);
	bool check(T key); // Check 
	// operations
	bool insert(T newItem);
	bool search(T key);
}; 

bool HASH_TABLE<T>::insert(T newItem)
{
	int hashindex = this->HashFunction(newItem);
	cout << hashindex;
	
	Node<T>* p = new Node <T>;
	if (p != NULL)
	{
		p->key = newItem;
		p->next = NULL;
	}

	if (!items[hashindex].head)
	{
		items[hashindex].head = p;
		items[hashindex].count = 1;
		return true;
	}
	p->next = (items[hashindex].head);
    items[hashindex].head = p;
    items[hashindex].count++;
	return true;
	
	return false;
}

[LB]

Could you be more specific about the problem you're having?

[nightmaregiba]

i just need to know if my insert() function is correct

[LB]

The if statement on line 7 can never be true.

Line 24 can never be reached.

[nightmaregiba]

my mistake

[LB]

Do you require further help?

[nightmaregiba]

Oh yes

here is my code to delete all Hash table

template <class T>
int HASH_TABLE<T>::deleteHashTable()
{
//count here to count the number of conflict element
	int count = 0;
	for (int i = 0; i < maxSize; i++)
	{
		Node<T>* p;
		while (items[i].head != NULL)
		{		
			p = items[i].head;
			items[i].head = items[i].head->next;
			delete p;
			if (items[i].count != 1) 
				count ++;
		}
	}
	delete []items;
	return count;
}

is it ok, thanks in advance!!!!