# Remove Last Node from the List

Given a Linked List, we need to remove the last node or last element from the List.

Input : 1 -> 2 -> 3 -> 4 -> 5

Output : 1 -> 2 -> 3 -> 4

## Straight Forward Approach

1)Check the edge cases

Checking the edge cases is crucial in programming world. It is very important.

Edge cases are:

What happen if head is null? and What happen if next to the head element(head.next) is null?

In both the above cases we have to return null😜

2) Removing Last Node

So to remove the last node, we need to know the node which is before to the last node. In our case, 1 -> 2 -> 3 -> 4-> 5, 4 is the node which is before to the last node.

So we have to iterate the loop to point the last node’s beforth position.

Time to cut the last node, at the beforth position of last node, apply the null to the next pointer. Then the connection to the last node cuts off.

Program to Remove Last Node from the List

```class ListNode
{
public int val;
public ListNode next;
public ListNode(int data)
{
val = data;
}
}
class Program
{
static void Main(string[] args)
{
//1 --> 2 --> 3 --> 4 --> 5
ListNode head = new ListNode(1);
head.next = new ListNode(2);
head.next.next = new ListNode(3);
head.next.next.next = new ListNode(4);
head.next.next.next.next = new ListNode(5);

ListNode temp = head;
Console.WriteLine("Before removing last node from the List");
while(temp != null)
{
Console.WriteLine(temp.val);
temp = temp.next;
}

//Remove last node from the list, in this case last node is 5
//Remove 5 from the list

Console.WriteLine("After removing last node from the List");
{
}

}

private static ListNode RemoveLastElement(ListNode head)
{
//1. Edge case
//when head is null, we need to return null
if (head == null)

//2. Edge case
//when head.next is null, then head is the last element, so we need
to make the head -> null
{
}
else
{
//3. Little Logic
while(head.next != null && head.next.next != null)
{