数据结构----符号表

首先，定义符号表（有序）的API：

public class ST<Key extends Comparable<Key>, Value>{ ST()                                                                //创建符号表 void put(Key key,Value val)                            //将键值对存入表中 Value get(Key,key)                                        //获取key相对应的值 void delete(Key,key)                                        //删除键值对 boolean contains(Key,key)                            //key是否存在 boolean isEmpty()                                            //表是否为空 int size()                                                        //当前键值对数量 Key min()                                                        //最小键 Key max()                                                      //最大键 Key floor(Key key)                                         //小于等于key的最大键 Key ceiling(Key key)                                        //大于等于key的最小键 int rank(Key key)                                            //小于key键的数量 Key select(int k)                                                //排名为k的键 void deleteMin()                                             //删除最小的建 void deleteMax()                                            //删除最大的键 int size(Key lo,Key hi)                                        //[lo...hi]之间键的数量 Iterable<Key> keys(Key lo,Key hi)                    //[lo...hi]之间的所有键 Iterable<Key> keys()                                         //表中所有键的集合 }

符号表的各种实现的优缺点

各种符号表实现的渐进性能总结