简单二叉树数据结构（JAVA）

public class BinaryTreeNode {
    
    
    
    private int data;
    private BinaryTreeNode left;
    private BinaryTreeNode right;
    private int getData(){
    
    
        return data;
    }

    public void setData(int data){
    
    
        this.data = data;
    }

    public BinaryTreeNode getLeft(){
    
    
        return left;
    }

    public void setLeft(BinaryTreeNode left){
    
    
        this.left = left;
    }

    public BinaryTreeNode getRight(){
    
    
        return right;
    }

    public void setRight(BinaryTreeNode right){
    
    
        this.right = right;
    }

}