<div>
A queue implemented with an array has a pre-defined length and this cannot be changed without allocating a whole new array and copying the contents of the original, where a queue implemented with nodes and pointers will grow/shrink as needed.<br />
<br />
Java doesn't use the concept of a pointer, though - at least not explicitly.<br />
<br />
If you use an array, simply use an array. &nbsp;If you wnat to use the node/pointer approach use java.util.LinkedList as you underlying data structure.
</div>


A queue implemented with an array has a pre-defined length and this cannot be changed without allocating a whole new array and copying the contents of the original, where a queue implemented with nodes and pointers will grow/shrink as needed.

Java doesn't use the concept of a pointer, though - at least not explicitly.

If you use an array, simply use an array.  If you wnat to use the node/pointer approach use java.util.LinkedList as you underlying data structure.

<div>
<div class="content wysiwyg-content">
i would like to know what are are the advantages and disadvantages of<br />
<br />
Queues implemented as an array<br />
Queues implemented with nodes and pointers<br />
<br />
<br />
i am a newbie so please explain a bit and examples would be great!<br />
<br />
thank you for your help!!!<br />
<br />
steven
</div>
</div>


i would like to know what are are the advantages and disadvantages of

Queues implemented as an array
Queues implemented with nodes and pointers


i am a newbie so please explain a bit and examples would be great!

thank you for your help!!!

steven

queue's

Java is a platform-independent, object-oriented programming language and run-time environment, designed to have as few implementation dependencies as possible such that developers can write one set of code across all platforms using libraries. Most devices will not run Java natively, and require a run-time component to be installed in order to execute a Java program.