Linked Lists Implementation using java and the absence of pointers

Question

I am trying to implement a linked list in java. From my knowledge of C++ linked list were implemented by creating a node class:::

struct Node
{
int data;
struct Node *next;
}

And similiar to this I've found that in java node is created by:::

class Node {
int data;
Node next;
}

My doubt is that in the java class there is no address pointing to the next node. In fact what I am able to interpret is that every node recursively will have another node inside it and not its location which theoretically should be the case. I tried finding some help on java forums and they say that the "next" node is actually acting like the c++ pointer but syntax-wise I don't see why would it give the address and not the node itself.

What does _node inside it_ mean to you? How is that different from _its location_? Obviously, you don't have pointers in Java so work with what you have, reference values. — Sotirios Delimanolis, Jul 12 '16 at 14:40
Exactly my point..A node is supposed to have just the "address" of the subsequent node not it's actual value. @Sotirios Delimanolis — P_K, Jul 12 '16 at 14:45
The value of any reference type is a reference to an object. — Sotirios Delimanolis, Jul 12 '16 at 15:04
Simply put 'Node next;' holds only a reference to next. Not the object itself. — c0der, Jul 13 '16 at 05:06

score 0 · Answer 1 · answered Jul 12 '16 at 14:48

0

"In fact what I am able to interpret is that every node recursively will have another node inside it and not its location " is not true, the node attribute in a node instance will be set to a reference to the next node, not the object itself

answered Jul 12 '16 at 14:48

McBoogerball

1
3

I could be wrong on this but why must it be so? If we are creating an object or variable then it is supposed to store data inside it and not its location on the memory. – P_K Jul 12 '16 at 14:56

Linked Lists Implementation using java and the absence of pointers

1 Answers1