Node:
public class Node{
int data;
Node next;
Node (int d)
{
data = d ;
// next= null;
}
}
public class Linklist {
Node head;
public void insert(int d){
Node newNode= new Node(d);
if (head==null)
head=newNode;
else
{
Node Temp;
//Prev;
Temp=head;
//Prev=head;
while (Temp.next!=null && d>Temp.data){
Temp=Temp.next;
}
if (Temp.next==null){ //insert as last node
}
else if (Temp==head) // insert as first node
{
newNode.next=head;
head=newNode;
}
else{
newNode.next=Temp.next;
Temp.next=newNode;
}
}
}
public void display(){
Node Temp= head;
while(Temp != null){
}
}
}
public class Node{
int data;
Node next;
Node (int d)
{
data = d ;
// next= null;
}
}
//////////////////
LinkList:
public class Linklist {
Node head;
public void insert(int d){
Node newNode= new Node(d);
if (head==null)
head=newNode;
else
{
Node Temp;
//Prev;
Temp=head;
//Prev=head;
while (Temp.next!=null && d>Temp.data){
Temp=Temp.next;
}
if (Temp.next==null){ //insert as last node
}
else if (Temp==head) // insert as first node
{
newNode.next=head;
head=newNode;
}
else{
newNode.next=Temp.next;
Temp.next=newNode;
}
}
}
public void display(){
Node Temp= head;
while(Temp != null){
}
}
}
///////////////////
LinkListDemo:
public class LinkListDemo {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Linklist Mylist=new Linklist();
Mylist.insert(30);
Mylist.insert(50);
Mylist.insert(60);
Mylist.insert(70);
}
}
No comments:
Post a Comment