package
traverse
;
class
QueueAsStruc
<
T
>
implements
Structure
<
T
>
{
Queue
<
T
>
queue
;
public
QueueAsStruc
()
{
queue
=
new
LQueue
<
T
>
()
;
}
public
void
put
(
T
item
)
{
queue
.
add
(
item
)
;
}
public
T
get
()
throws
EmptyStructure
{
return
queue
.
remove
()
;
}
public
boolean
isEmpty
()
{
return
queue
.
isEmpty
()
;
}
}