二叉树与二分搜索树

性质：

具有唯一的根节点

每个节点最多有两个孩子

二叉树每个孩子最多有一个父亲

具有天然递归结构——每个节点左右孩子也是二叉树

满二叉树：除了叶子结点，每个节点都有两个孩子。

 

二叉树不一定“满”的

 

一个节点也是二叉树

NULL也是二叉树

 

二分搜索树（Binary Search Tree）

性质：

是二叉树

每个节点的值：

    大于其左子树所有节点的值

    小于其右子树所有节点的值

每一棵子树也是二分搜索树

存储的元素必须具有可比较性

 

此处实现的二分搜索树不包含重复元素

import java.util.Queue;
import java.util.Stack;
import java.util.LinkedList;

public class BST<E extends Comparable<E>> {

    private class Node {
        public E e;
        public Node left, right;

        public Node(E e) {
            this.e = e;
            left = null;
            right = null;
        }
    }

    //根节点
    private Node root;
    private int size;

    public BST() {
        root = null;
        size = 0;
    }

    public int Size() {
        return size;
    }
    public boolean isEmpty(){
        return size == 0;
    }

    //向二分搜索树添加元素e
    public void add(E e){
        root = add(root, e);
    }
    //返回插入新节点后二分搜索树的根
    private Node add(Node node, E e){
        if(node == null){
            size++;
            return new Node(e);
        }
        if(e.compareTo(node.e) < 0){
            node.left = add(node.left, e);
        }
        else if(e.compareTo(node.e) > 0){
            node.right = add(node.right, e);
        }
        return node;
    }

    //查看二分搜索树是否包含元素e
    public boolean contains(E e){
       return contains(root, e);
    }
    private boolean contains(Node node, E e){
        if(node == null){
            return false;
        }
        if(e.compareTo(node.e) == 0){
            return true;
        }
        else if(e.compareTo(node.e) < 0){
            return contains(node.left, e);
        }else {
            return contains(node.right,e);
        }
    }

    //二分搜索树前序遍历
    public void preNode(){
        preNode(root);
    }
    private void preNode(Node node){
        if(node == null){
            return;
        }
        System.out.println(node.e);
        preNode(node.left);
        preNode(node.right);
    }

    //二分搜索树前序遍历非递归实现
    public void preNodeNR(){
        Stack<Node> stack = new Stack<>();
        stack.push(root);
        while (!stack.isEmpty()){
            Node cur = stack.pop();
            System.out.println(cur.e);
            if(cur.right != null){
                stack.push(cur.right);
            }
            if(cur.left != null){
                stack.push(cur.left);
            }
        }
    }

    //二分搜索树中序遍历
    public void inNode(){
        inNode(root);
    }
    private void inNode(Node node){
        if(node == null){
            return;
        }
        inNode(node.left);
        System.out.println(node.e);
        inNode(node.right);
    }

    //二分搜索树后序遍历
    public void postNode(){
        postNode(root);
    }
    private void postNode(Node node){
        if(node == null){
            return;
        }
        postNode(node.left);
        postNode(node.right);
        System.out.println(node.e);
    }

    //二分搜索树层序遍历
    public void levelNode(){
        Queue<Node> q = new LinkedList();
        ((LinkedList<Node>) q).add(root);
        while (!q.isEmpty()){
            Node cur = q.remove();
            System.out.println(cur.e);
            if(null != cur.left){
                q.add(cur.left);
            }
            if(null != cur.right){
                q.add(cur.right);
            }
        }
    }

    //寻找二分搜索树的最小元素
    public E minNum(){
        if(size == 0){
            throw new IllegalArgumentException("BST is empty");
        }
        return minNum(root).e;
        }
        private Node minNum(Node node){
        if(node.left == null){
            return node;
        }
        return minNum(node.left);
    }

    //寻找二分搜索树的最大元素
    public E maxNum(){
        if(size == 0){
            throw new IllegalArgumentException("BST is empty");
        }
        return maxNum(root).e;
    }
    private Node maxNum(Node node){
        if(node.right == null){
            return node;
        }
        return maxNum(node.right);
    }

    //从二分搜索树删除最小元素，并返回
    public E romveMin(){
        E ret = minNum();
        root = romveMin(root);
        return ret;
    }
    private Node romveMin(Node node){
        if(node.left == null){
            Node rightNode = node.right;
            node.right = null;
            size--;
            return rightNode;
        }
        node.left = romveMin(node.left);
        return node;
    }

    //从二分搜索树删除最大元素，并返回
    public E romveMax(){
        E ret = maxNum();
        root = romveMax(root);
        return ret;
    }
    private Node romveMax(Node node){
        if(node.right == null){
            Node leftNode = node.left;
            node.left = null;
            size--;
            return leftNode;
        }
        node.right = romveMax(node.right);
        return node;
    }

    //从二分搜索树删除元素e
    public void remove(E e){
        root = remove(root,e);
    }
    private Node remove(Node node,E e){
        if(node == null){
            return null;
        }
        if(e.compareTo(node.e)>0){
            node.right = remove(node.right,e);
            return node;
        }
        else if(e.compareTo(node.e)<0){
            node.left = remove(node.left,e);
            return node;
        }
        else {
            //待删除元素左子树为空
            if(node.left == null){
                Node rightNode = node.right;
                node.right = null;
                size--;
                return rightNode;
            }
            //待删除元素右子树为空
            if(node.right == null){
                Node leftNode = node.left;
                node.left = null;
                size--;
                return leftNode;
            }
        }
        //待删除元素左右子树均不为空
        //用比待删除节点大的最小的节点顶替待删除节点
        Node succer = minNum(node.right);
        succer.right = romveMin(node.right);
        succer.left = node.left;

        node.left = node.right = null;
        return succer;
    }

    @Override
    public String toString() {
        StringBuilder res = new StringBuilder();
        generadeBSTString(root, 0, res);
        return res.toString();
    }
    private void generadeBSTString(Node node, int depth, StringBuilder res){
        if(null == node){
            res.append(generadeDepthString(depth) + "null\n");
            return;
        }
        res.append(generadeDepthString(depth) + node.e + "\n");
        generadeBSTString(node.left, depth+1, res);
        generadeBSTString(node.right, depth+1, res);
    }
    private String generadeDepthString(int depth){
        StringBuilder res = new StringBuilder();
        for (int i = 0; i < depth; i++) {
            res.append("-");
        }
        return res.toString();
    }