TreeNode.java

package datastructures;

import model.Voter;

/**
 * Node for the Binary Search Tree that stores Voter information.
 * The tree is ordered by Government ID for O(log n) search time.
 */
public class TreeNode {
    private Voter voter;
    private TreeNode left;
    private TreeNode right;
    private int height;  // For AVL balancing

    public TreeNode(Voter voter) {
        this.voter = voter;
        this.left = null;
        this.right = null;
        this.height = 1;
    }

    public Voter getVoter() {
        return voter;
    }

    public void setVoter(Voter voter) {
        this.voter = voter;
    }

    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;
    }

    public int getHeight() {
        return height;
    }

    public void setHeight(int height) {
        this.height = height;
    }
}