Interface BSTree

src/tree/binary/bst.rs:9–22

use std::ptr::NonNull;

pub trait BSTree<K, V>
where
    K: Ord,
{
    fn insert(&mut self, key: K, val: V);
    fn delete(&mut self, key: &K);
    fn get(&self, key: &K) -> Option<&V>;
    fn min(&self) -> Option<&K>;
    fn max(&self) -> Option<&K>;
    /// 查找后继元素
    fn succ(&self, key: &K) -> Option<&K>;
    /// 寻找前驱元素
    fn pred(&self, key: &K) -> Option<&K>;
}

impl<K, V> BSTree<K, V> for Tree<K, V>
where