intbstnode.java

来自「经典的数据结构算法」· Java 代码 · 共 21 行

public class IntBSTNode {
    protected int key;
    protected IntBSTNode left, right;
    public IntBSTNode() {
        left = right = null;
    }
    public IntBSTNode(int el) {
        this(el,null,null);
    }
    public IntBSTNode(int el, IntBSTNode lt, IntBSTNode rt) {
        key = el; left = lt; right = rt;
    }
    public void visit() {
        System.out.print(key + " ");
    }
    public String toString() {
        return "" + key;
    }
}