this book i am reading through gives some code and code skeleton to explain how to use a linked stack. i have filled in all the code correctly...i think except for my push method which will add element to the top of a stack if its not full. it errors with the following:

cannot find symbol
symbol : constructor Node(java.lang.Object,Node)
location: class Node
Node newTop = new Node( val, top );
1 error
BUILD FAILED (total time: 0 seconds)

here is the node class required for the linkedstack class: (this came out of the book i am reading)

//************************************************************
// Node.java
// A general node for a singly linked list of objects.
//************************************************************
public class Node
{
private Node next;
private Object element;

//----------------
// Creates an empty node
//----------------
public Node()
{
next = null;
element = null;
}

//----------------
// Creates a node storing a specified element
//----------------
public Node(Object element)
{
next = null;
this.element = element;
}

//----------------
// Returns the node that follows this one
//----------------
public Node getNext()
{
return next;
}

//----------------
// Sets the node that follows this one
//----------------
public void setNext(Node node)
{
next = node;
}

//----------------
// Returns the element stored in this node
//----------------
public Object getElement()
{
return element;
}

//----------------
// Sets the element stored in this node
//----------------
public void setElement(Object element)
{
this.element = element;
}
}

ok, and here is my linkedstack class: problem is in the public void push(Object val) method:

// ****************************************************************
// LinkedStack.java
//
// An linked implementation of an Object stack class with operations push,
// pop, and isEmpty and isFull.
//
// ****************************************************************
public class LinkedStack implements StackADT
{
private Node top; // reference to top of stack

// ----------------
// Constructor -- initializes top
// ----------------
public LinkedStack()
{
top = null; // Creates an empty stack
}

// ----------------
// Adds element to top of stack if its not full, else
// does nothing.
// ----------------
public void push(Object val)
{
while (!isFull()) {
// Create a new node and make it point to the top of the stack
Node newTop = new Node( val, top );
// The top of the stack is in the new node
top = newTop;
}
}

// ----------------
// Removes and returns value at top of stack. If stack
// is empty returns null.
// ----------------
public Object pop()
{
if (isEmpty()) throw new RuntimeException("Stack underflow");
top = top.getNext();
return top.getElement();
}

// ----------------
// Returns true if stack is empty, false otherwise.
// ----------------
public boolean isEmpty()
{
return top == null;
}

// ----------------
// Returns true if stack is full, false otherwise.
// ----------------
public boolean isFull()
{
return false;
}
}