Delete Node Error

[ButchCavendish]

Hi there..
I'm having much trouble in my following program Delete function is not working properly my rest program is working fine (that's what I think only)
Thanks in advance to helping hands

#include <iostream>
using namespace std;

struct Node
{
	char name[15];
	int ID;
	int age;
	float height;
	Node *next;
};

	Node *temp;
	Node *head;
	Node *tail;

	bool IsEmpty();
	bool isFull();
	void AddNode ();
	void DeleteNode ();
	void DeleteList();
	void Search();
	void Display ();
	bool isEmpty()
	{
		return (head==0 && tail==0);
	}

	bool isFull()
	{
		return false;
	}


	void AddNode ()
	{
		temp=new Node;
		cout<<"Enter the ID of person: ";
		cin>>temp->ID;
		cout<<"Enter the name of person: ";
		cin>>temp->name;
		/*cout<<"Enter the age of person: ";
		cin>>temp->age;
		cout<<"Enter the height of person: ";
		cin>>temp->height;*/
		temp->next=NULL;

		if (head==0 && tail==0)
		{
			head= temp;
			tail= temp;
		}
		else
		{
			tail->next=temp;
			tail= temp;
		}

	}

	void Search()
	{
		int Search_ID;
		cout<<"Enter the ID to search: ";
		cin>>Search_ID;
		bool flag=true;
		
		temp=head;
		while (temp != NULL)
		{
			if (temp->ID == Search_ID)
			{
				cout<<"ID of person: "<<temp->ID<<endl;
				cout<<"Name of person: "<<temp->name<<endl;
			}
			else
			{
				flag=false;
			}
			
			temp=temp->next;
		}
			if (flag==false)
			{
				cout<<"No record found with that ID\n";
			}
	}

	void Delete ()
	{
		int delete_ID;
		cout<<"Enter the ID to delete: ";
		cin>>delete_ID;

		Node *prev=head;
	
		if (head == tail && delete_ID== head->ID)
		{
			delete head;
			head=tail=NULL;
		}
		else if (delete_ID=head->ID)
		{
			
			temp= head;
			head=head->next;
			delete temp;
		}
		else
		{
			temp=prev->next;
			while (temp != NULL)
			{
				if (temp->ID == delete_ID)
				{
					prev=temp->next;
					delete temp;
				}
				temp=temp->next;
				temp=prev->next;
			}
		}

	}

	void Display()
	{
		temp=head;
		cout<<"\n\nList is: \n";
		while (temp != NULL)
		{
			cout<<"Name of person: "<<temp->name<<endl;
			temp=temp->next;
		}
	}
	int main ()
	{
		for (int k=0; k<5; k++)
		{
			AddNode();
		}
		Search();
		Delete();
		Display();
	}

[dhayden]

Your Search() function is wrong too. You're setting flag=false if any node in the list doesn't match. I think you'll find that if one node mathes and one node doesn't then it prints the matching node followed by "no record found." To fix this, break out of the loop when you find the matching record. Then after the loop, just check if temp==NULL. If it does then you didnt' find the record.

Oh, use nullptr instead of NULL.

As for delete, I suggest you consider the following cases separately:
- the list is empty.
- You delete the first item in the list
- You delete the nth item in the list

In the last 2 cases, also consider what happens if you delete the last item in the list. Write your code to handle these cases in this order.