package sort;
/*
*Tree Node for the heap sort
*
* asevans 9.9.2013
*/
public class TreeNode<E extends Comparable> {
private E value;
private TreeNode<E> left;
private TreeNode<E> right;
private TreeNode<E> parent;
public TreeNode(E inval, TreeNode<E> inleft, TreeNode<E> inright,
TreeNode<E> inparent) {
// TODO construct Node
value = inval;
right = inright;
left = inleft;
parent = inparent;
}
public E getValue() {
// TODO return the value
return value;
}
public void setValue(E inval) {
// TODO set the value
value = inval;
}
public TreeNode<E> getParent() {
// TODO get parent
return parent;
}
public TreeNode<E> getRight() {
// TODO return right value
return right;
}
public TreeNode<E> getLeft() {
// TODO return left value
return left;
}
public void setRight(TreeNode<E> inright) {
// TODO set right node
right = inright;
}
public void setLeft(TreeNode<E> inleft) {
// TODO set left node
left = inleft;
}
public void setParent(TreeNode<E> inparent) {
// TODO set parent node
parent = inparent;
}
}