package algorithm.utils;

/**

* @author Ethan Zhang

* @date 2022/3/19

*/

public class TreeNode {

public int value;

public TreeNode left;

public TreeNode right;

public TreeNode(int value) {

this.value = value;

}

public TreeNode(int value, TreeNode left, TreeNode right) {

this.value = value;

this.left = left;

this.right = right;

}

@Override

public boolean equals(Object o) {

if (this == o) {

return true;

}

if (o == null || getClass() != o.getClass()) {

return false;

}

TreeNode treeNode = (TreeNode) o;

return value == treeNode.value;

}

@Override

public int hashCode() {

return value;

}

public int getValue() {

return value;

}

public void setValue(int value) {

this.value = value;

}

public TreeNode getLeft() {

return left;

}

public void setLeft(TreeNode left) {

this.left = left;

}

public TreeNode getRight() {

return right;

}

public void setRight(TreeNode right) {

this.right = right;

}

}