How to implement pointer concept in java

[aruna_mishra]

How to write a program for a linkedlist without using the collection framework

[nspils]

All datatypes (other than the simple/base/elemental types int, short, float, char, boolean, etc.) are "reference" types. When you use the instance's name, you are passing a reference to the memory location where the object is being stored. So, when you build your linked list, you will not be copying objects, but storing references to the next Node and the element being stored in the Node of interest. The location's name acts, almost, like a pointer.

So ... what's holding you up? Just write a Node class which has the links you want (prior, next, parent, child, whatever) as some of the fields and the methods you need to manipulate your element.

[aruna_mishra]

Can u please send me the program regarding this. I need it.. i tried to write one but failed..

Thank U

[nspils]

why don't you post your code for the part where your attempt failed and we can work on it?

[xnowloadingx]

I have written a sample. It should be good enough for you to get started. You should try to implement delete and iterator yourself.

public class Node <T>{

private T item;
private Node<T> next;

public Node (T item)
{
this.item = item;
}
public void set(T item)
{
this.item = item;
}

public T get()
{
return item;
}

public void setNext(Node<T> node)
{
next = node;
}
}


public class LinkedList <T>{
private Node<T> last;
private Node<T> first;
private int count;

public LinkedList()
{
first = null;
last = null;
count = 0;
}

public LinkedList(T item)
{
first = new Node<T>(item);
last = first;
count++;
}

public void add(T item)
{
if(count == 0)
{
first = new Node<T>(item);
last = first;
}
else
{
Node<T> tmpNode = new Node<T>(item);
last.setNext(tmpNode);
last = tmpNode;
}
count++;
}

public int size()
{
return count;
}

}



public class main {

/**
* @param args
*/
static public void main(String[] args) {
int MAX = 10;
LinkedList<Integer> list = new LinkedList<Integer>();

for(int i = 0; i< MAX; i++)
{
list.add(i);
}
}

}