Skip to main content

Delete node at a given position in Linked List

Delete node at a given position in Linked List



//delete node by position in linked list
 public Node deleteKeyAtPosition(Node head,int position)
 {
  
  Node temp=head;
  Node prevtemp=temp;
  int c=1;
  //if position is head
  if(position==1)
  {
   head=head.next;
   return head;
  }
  //position +1 because we have to go till that point
  while(c!=position+1)
  {
   if(c==position && position!=1)
   {
    prevtemp.next=temp.next;
    temp.next=null;
    temp=prevtemp;
   }
   prevtemp=temp;
   temp=temp.next;
   c++;
  }
  return head; 
 }

Comments

.

Popular posts from this blog

Insertion Sort in JAVA

What is insertion sort?

It is a sorting technique that is based on the partitioning of array into two parts like selection sort, sorted and unsorted.

The process is:-

compare adjacent elements.
if(left > right)
Swap the element
{
check for sorted array whether it is still in sort manner(put j=i and loop in until j is not equal to zero)
- No
check for if(right<left)
swap
do it until at the end of position.
}

Implementation:-

Underline eleemnts are part of sorted arrayinside main array loop 142710333519424 (141027333519424 (here sorted array is distorted hence sorting has been done inside the loop) inside sorted array loop101427333519424 inside main array loop101427333519424 inside main array loop 101427333519424 inside main array loop101427333519424 inside sorted array loop 101427193335424 inside sorted array loop 101419273335424 inside main array loop 101419273335424 inside main array loop 101419273335424 inside sorted array loop101419273343542 inside…