Deletion from End in Doubly Linked List in C++

Run

#include< iostream>
using namespace std;
struct node
{
  int num;
  struct node *preptr;
  struct node *nextptr;
}
 *stnode, *ennode;


void DlListcreation (int n);
void DeleteLastnode ();
void displayDlList ();

int main ()
{
  int n, num1, insPlc;
  stnode = NULL;
  ennode = NULL;
  cout << " Enter the number of nodes: "; cin >> n;
  DlListcreation (n);
  cout << "Linked list before deletion is:" << "\n";
  displayDlList ();
  DeleteLastnode ();
  cout << "Linked list after deletion of node from end is :" << "\n"; displayDlList (); return 0; } void DlListcreation (int n) { int i, num; struct node *fnNode; if (n >= 1)
    {
      stnode = (struct node *) malloc (sizeof (struct node));
      if (stnode != NULL)
	{
	  cout << " Enter data for node 1: "; // assigning data in the first node cin >> num;
	  stnode->num = num;
	  stnode->preptr = NULL;
	  stnode->nextptr = NULL;
	  ennode = stnode;
	  for (i = 2; i <= n; i++)
	    {
	      fnNode = (struct node *) malloc (sizeof (struct node));
	      if (fnNode != NULL)
		{
		  //  int t;
		  cout << " Enter data for node " << i <<": "; cin>>num;
		  fnNode->num = num;
		  fnNode->preptr = ennode;	// new node is linking with the previous node
		  fnNode->nextptr = NULL;	// set next address of fnnode is NULL
		  ennode->nextptr = fnNode;	// previous node is linking with the new node
		  ennode = fnNode;	// assign new node as last node
		}
	      else
		{
		  cout << " Memory can not be allocated.";
		  break;
		}
	    }
	}
      else
	{
	  cout << " Memory can not be allocated.";
	}
    }
}

void DeleteLastnode ()
{
  struct node *NodeToDel;

  if (ennode == NULL)
    {
      cout << " Delete is not possible. No data in the list.\n"; } else { NodeToDel = ennode; ennode = ennode->preptr;	// move the previous address of the last node to second last node
      ennode->nextptr = NULL;	// set the next address of last node to NULL
      free (NodeToDel);		// delete the last node
    }
}

void displayDlList ()
{
  struct node *tmp;
  tmp = stnode;
  int n = 1;
  while (tmp != NULL)
    {
      cout << " node " << n << ": " << tmp->num << "\n"; n++; tmp = tmp->nextptr;	// current pointer moves to the next node
    }
}