查找二叉树中的节点

/**
 * BST树的节点类型
 * @param <T>
 */
class BSTNode <T extends Comparable<T>>{
    private T data; // 数据域
    private BSTNode<T> left; // 左孩子域
    private BSTNode<T> right; // 右孩子域

    public BSTNode(T data, BSTNode<T> left, BSTNode<T> right) {
        this.data = data;
        this.left = left;
        this.right = right;
    }

    public T getData() {
        return data;
    }

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

    public BSTNode<T> getLeft() {
        return left;
    }

    public void setLeft(BSTNode<T> left) {
        this.left = left;
    }

    public BSTNode<T> getRight() {
        return right;
    }

    public void setRight(BSTNode<T> right) {
        this.right = right;
    }
}

树的操作

/**
 * BST树的实现
 * @param <T>
 */
class BST<T extends Comparable<T>>{
    private BSTNode<T> root; // 指向根节点

    /**
     * BST树的初始化
     */
    public BST() {
        this.root = null;
    }
    /**
     * 在BST树种，搜索值为data的节点，找到返回true，找不到返回false
     * @param data
     * @return
     */
    public boolean non_query(T data){
        BSTNode<T> cur = this.root;
        while (cur != null){
            if (cur.getData().compareTo(data) > 0){
                cur = cur.getLeft();
            }
            else if(cur.getData().compareTo(data) < 0) {
                cur = cur.getRight();
            }else if (cur.getData().compareTo(data) == 0){
                return  true;
            }
        }
        return false;
    }
}