cout<<"M E N U";
cout<<"[a] add a new student"; // adds a new student to the database
cout<<"[d] delete student"; // deletes a student
cout<<"[e] edit student"; // edits the students information
cout<<"[v] view student"; // view students information

// if [a] is the choice
cout<<"enter the following info's"
cout<<"name: ";
cin>> // what should i exactly put in here
cout<<"address: ";
cin>> // same as the above
cout<<"scores: ";
cin>> // same
cout<<"age: ";
cin>>same;

// if [d],[e] or [v] is the choice
cout<<"enter student's name: ";

char name[50] = "";

cout << "Enter a name: ";
cin  >> name;

struct snode
{
   char *student_name;
   char *student_address;
   char *student_ID;
   struct snode *next;
};
typedef struct my_stack
{
   struct snode *head;
   struct snode *tail;
} stack;

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

struct snode
{
   char *student_name;
   char *student_address;
   char *student_ID;
   struct snode *next;
   struct snode *pre;
};

typedef struct my_stack
{
   struct snode *head;
   struct snode *tail;
} my_stack;

//Init the stack.
void init_stack(my_stack *the_stack);

//Add a record to the stack.
int add_record(my_stack *the_stack,char *name,char *address,char *ID);

//Search a record in the stack. Return a pointer to the node, if exists.
//else return NULL.
struct snode search_record(char *ID);

//Print stack by order, to the standard output.
void print_stack(my_stack *the_stack);

void main()
{
	char user_choice = '\0';
	my_stack the_stack;
	init_stack(&the_stack);
	while (user_choice != 'q')
	{
		//Print Menu to the screen.
		printf("Menu\n");
		printf("----\n");
		printf("[a] add a new student.\n");
		printf("[d] delete student.\n");
		printf("[e] edit student.\n");
		printf("[v] view student.\n");
		printf("[q] quit program.\n");	//You don't suppose the user want to grow old with the application :-)
		user_choice = getchar();
	}
	
	//Example code for you. These are the appropriate ways of using the "add_record" and "print_stack" functions.
	add_record(&the_stack,"Kobi","Israel","1234567");
	add_record(&the_stack,"You","Must","Do your own homework");
	print_stack(&the_stack);
}

void init_stack(my_stack *the_stack)
{
	the_stack->head = NULL;
	the_stack->tail = NULL;
}

int add_record(my_stack *the_stack,char *name,char *address,char *ID)
{
	int result = 1;
	//First, create the new stack node.
	struct snode *new_snode;
	new_snode = malloc(sizeof(struct snode));
	if (new_snode == NULL)
	{
		printf("Memory allocation failed.\n");
		result = 0;
	}
	else
	{
		//Allocate memory for record data.
		new_snode->student_name = malloc(sizeof(strlen(name) + 1));
		new_snode->student_address = malloc(sizeof(strlen(address) + 1));
		new_snode->student_ID = malloc(sizeof(strlen(ID) + 1));
		if (new_snode->student_name == NULL || new_snode->student_address == NULL
			|| new_snode->student_ID == NULL)
		{
			printf("Memory allocation failed.\n");
			result = 0;
		}
		else
		{
			//Store data in the new node.
			strcpy(new_snode->student_name,name);
			strcpy(new_snode->student_address,address);
			strcpy(new_snode->student_ID,ID);
			//Check if the stack is empty.If so, add record as first record.
			if (the_stack->head == NULL)
			{
				//Insert at the head.
				new_snode->next = NULL;
				new_snode->pre = NULL;
				the_stack->head = new_snode;
				the_stack->tail = new_snode;
			}
			else
			{
				//Insert at the tail.
				new_snode->pre = the_stack->tail;
				new_snode->next = NULL;
				the_stack->tail->next = new_snode;
				the_stack->tail = new_snode;
			}
		}
	}
	return (result);
}

void print_stack(my_stack *the_stack)
{
	struct snode *iterator = the_stack->head;
	while (iterator != NULL)
	{
		printf ("%s\t%s\t%s\n",iterator->student_name,iterator->student_address,iterator->student_ID);
		iterator = iterator->next;
	}
	
}

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

struct snode
{
   char *student_name;
   char *student_address;
   char *student_ID;
   struct snode *next;
   struct snode *pre;
};

typedef struct my_stack
{
   struct snode *head;
   struct snode *tail;
} my_stack;

//Init the stack.
void init_stack(my_stack *the_stack);

//Add a record to the stack.
int add_record(my_stack *the_stack,char *name,char *address,char *ID);

//Search a record in the stack. Return a pointer to the node, if exists.
//else return NULL.
struct snode search_record(char *ID);

//Print stack by order, to the standard output.
void print_stack(my_stack *the_stack);

void main()
{
  char user_choice = '\0';
  my_stack the_stack;
  init_stack(&the_stack);
  while (user_choice != 'q')
  {
    //Print Menu to the screen.
    printf("Menu\n");
    printf("----\n");
    printf("[a] add a new student.\n");
    printf("[d] delete student.\n");
    printf("[e] edit student.\n");
    printf("[v] view student.\n");
    printf("[q] quit program.\n");  //You don't suppose the user want to grow old with the application :-)
    user_choice = getchar();
  }
  
  //Example code for you. These are the appropriate ways of using the "add_record" and "print_stack" functions.
  add_record(&the_stack,"Kobi","Israel","1234567");
  add_record(&the_stack,"You","Must","Do your own homework");
  add_record(&the_stack,"It","Compiles","Just fine");
  print_stack(&the_stack);
}

void init_stack(my_stack *the_stack)
{
  the_stack->head = NULL;
  the_stack->tail = NULL;
}

int add_record(my_stack *the_stack,char *name,char *address,char *ID)
{
  int result = 1;
  //First, create the new stack node.
  struct snode *new_snode;
  new_snode = malloc(sizeof(struct snode));
  if (new_snode == NULL)
  {
    printf("Memory allocation failed.\n");
    result = 0;
  }
  else
  {
    //Allocate memory for record data.
    new_snode->student_name = malloc(sizeof(strlen(name) + 1));
    new_snode->student_address = malloc(sizeof(strlen(address) + 1));
    new_snode->student_ID = malloc(sizeof(strlen(ID) + 1));
    if (new_snode->student_name == NULL || new_snode->student_address == NULL
      || new_snode->student_ID == NULL)
    {
      printf("Memory allocation failed.\n");
      result = 0;
    }
    else
    {
      //Store data in the new node.
      strcpy(new_snode->student_name,name);
      strcpy(new_snode->student_address,address);
      strcpy(new_snode->student_ID,ID);
      //Check if the stack is empty.If so, add record as first record.
      if (the_stack->head == NULL)
      {
        //Insert at the head.
        new_snode->next = NULL;
        new_snode->pre = NULL;
        the_stack->head = new_snode;
        the_stack->tail = new_snode;
      }
      else
      {
        //Insert at the head.
        new_snode->pre = NULL;
        new_snode->next = the_stack->head;
        the_stack->head = new_snode;
      }
    }
  }
  return (result);
}

void print_stack(my_stack *the_stack)
{
  struct snode *iterator = the_stack->head;
  while (iterator != NULL)
  {
    printf ("%s\t%s\t%s\n",iterator->student_name,iterator->student_address,iterator->student_ID);
    iterator = iterator->next;
  }
  
}