Skip to main content

Adding Node at a given position in Linked List

Adding Node at a given position in Linked List

 


public void addNodeAtPosition(Node head,int position,int data)
 {
  Node temp=head;
  //create a node
  Node node=new Node(data);
  int c=1;
  //while counter is not equal to the position
  while(c!=position)
  {
   temp=temp.next;
   c++;
  }
  //point node to the next of current node
  node.next=temp.next;
  //point next of current to the node to insert
  temp.next=node;
 }



To Know the basic structure of the linked list click here
Labels:

Comments

Post a Comment

.

Popular posts from this blog

Solved: com.microsoft.sqlserver.jdbc.SQLServerException: The index 1 is out of range.

This error usually comes when we try to insert data in a query where there is no index defined for it. Example :- String strQuery=“select * from location where city_id=? ”; The question mark will be the the first index if we want to insert data so if we call a function like- oPreparedStatement = oConnection.prepareStatement(strQuery); oPreparedStatement.setString(1,235); here we are sending 235 as a first parameter so it will work fine but as soon as we write something after it like oPreparedStatement.setString(2,”kanpur”) then it will throw “The index 2 is out of range” since there is no place to send this value in a query hence it will throw the same error. Here index defines the parameter for which there is no place in the query. To rectify this we need to write query like- String strQuery=“select * from location where city_id=? And city_name=? ”; then it will work fine. The cases in which these errors can occur is- 1)Query is co
Post a Comment
Read more

Heap implementation in JAVA

In this tutorial we will see all the functionalities of heaps implemented through java language. package com . problems . heap ; public class HeapFunctions { //Function to generate maxheapify where root is max than childs public void maxHeapify ( int Arr [], int i , int N ) { int largest ; int left = 2 * i + 1 ; //left child int right = 2 * i + 2 ; //right child System . out . println ( "left" + " " + left ); System . out . println ( "right" + " " + right ); System . out . println ( "Max size" + " " + N ); if ( left < N && Arr [ left ] > Arr [ i ] ) { largest = left ; System . out . println ( "largest left" + largest ); } else { largest = i ; System . out . println ( "largest i" + largest ); } if ( rig
Post a Comment
Read more