package com.pop.practice.homework.first.tree;
class BinaryNode<T> {
private T data;
private BinaryNode left;
private BinaryNode right;
public BinaryNode(T data, BinaryNode left, BinaryNode right) {
this.data = data;
this.left = left;
this.right = right;
}
public T getData() {
return data;
}
public void setData(T data) {
this.data = data;
}
public BinaryNode getLeft() {
return left;
}
public void setLeft(BinaryNode left) {
this.left = left;
}
public BinaryNode getRight() {
return right;
}
public void setRight(BinaryNode right) {
this.right = right;
}
}