/* Java Program to Implement Binary Search Tree
*/
import java.util.Date;

/* Class BSTNode */
class BSTNode {
	BSTNode left, right;
	Item data;

	/* Constructor */
	public BSTNode(Item element) {
		left = null;
		right = null;
		data = new Item(element.code, element.name, element.price, element.amount, element.receivedDate,
				element.expirationDate);
	}

	/* Function to set left node */
	public void setLeft(BSTNode n) {
		left = n;
	}

	/* Function to set right node */
	public void setRight(BSTNode n) {
		right = n;
	}

	/* Function to get left node */
	public BSTNode getLeft() {
		return left;
	}

	/* Function to get right node */
	public BSTNode getRight() {
		return right;
	}

	/* Function to set data to node */
	public void setData(Item d) {
		data = d;
	}

	/* Function to get data from node */
	public Item getData() {
		return data;
	}
}