类 BST<Key extends java.lang.Comparable<Key>,Value>
- java.lang.Object
-
- edu.princeton.cs.algs4.BST<Key,Value>
-
public class BST<Key extends java.lang.Comparable<Key>,Value> extends java.lang.ObjectTheBSTclass represents an ordered symbol table of generic key-value pairs. It supports the usual put, get, contains, delete, size, and is-empty methods. It also provides ordered methods for finding the minimum, maximum, floor, select, ceiling. It also provides a keys method for iterating over all of the keys. A symbol table implements the associative array abstraction: when associating a value with a key that is already in the symbol table, the convention is to replace the old value with the new value. UnlikeMap, this class uses the convention that values cannot benull—setting the value associated with a key tonullis equivalent to deleting the key from the symbol table.This implementation uses an (unbalanced) binary search tree. It requires that the key type implements the
Comparableinterface and calls thecompareTo()and method to compare two keys. It does not call eitherequals()orhashCode(). The put, contains, remove, minimum, maximum, ceiling, floor, select, and rank operations each take linear time in the worst case, if the tree becomes unbalanced. The size, and is-empty operations take constant time. Construction takes constant time.For additional documentation, see Section 3.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne. For other implementations, see
ST,BinarySearchST,SequentialSearchST,RedBlackBST,SeparateChainingHashST, andLinearProbingHashST,
-
-
构造器概要
构造器 构造器 说明 BST()Initializes an empty symbol table.
-
方法概要
修饰符和类型 方法 说明 Keyceiling(Key key)Returns the smallest key in the symbol table greater than or equal tokey.booleancontains(Key key)Does this symbol table contain the given key?voiddelete(Key key)Removes the specified key and its associated value from this symbol table (if the key is in this symbol table).voiddeleteMax()Removes the largest key and associated value from the symbol table.voiddeleteMin()Removes the smallest key and associated value from the symbol table.Keyfloor(Key key)Returns the largest key in the symbol table less than or equal tokey.Keyfloor2(Key key)Valueget(Key key)Returns the value associated with the given key.intheight()Returns the height of the BST (for debugging).booleanisEmpty()Returns true if this symbol table is empty.java.lang.Iterable<Key>keys()Returns all keys in the symbol table as anIterable.java.lang.Iterable<Key>keys(Key lo, Key hi)Returns all keys in the symbol table in the given range, as anIterable.java.lang.Iterable<Key>levelOrder()Returns the keys in the BST in level order (for debugging).static voidmain(java.lang.String[] args)Unit tests theBSTdata type.Keymax()Returns the largest key in the symbol table.Keymin()Returns the smallest key in the symbol table.voidput(Key key, Value val)Inserts the specified key-value pair into the symbol table, overwriting the old value with the new value if the symbol table already contains the specified key.intrank(Key key)Return the number of keys in the symbol table strictly less thankey.Keyselect(int k)Return the key in the symbol table whose rank isk.intsize()Returns the number of key-value pairs in this symbol table.intsize(Key lo, Key hi)Returns the number of keys in the symbol table in the given range.
-
-
-
方法详细资料
-
isEmpty
public boolean isEmpty()
Returns true if this symbol table is empty.- 返回:
trueif this symbol table is empty;falseotherwise
-
size
public int size()
Returns the number of key-value pairs in this symbol table.- 返回:
- the number of key-value pairs in this symbol table
-
contains
public boolean contains(Key key)
Does this symbol table contain the given key?- 参数:
key- the key- 返回:
trueif this symbol table containskeyandfalseotherwise- 抛出:
java.lang.IllegalArgumentException- ifkeyisnull
-
get
public Value get(Key key)
Returns the value associated with the given key.- 参数:
key- the key- 返回:
- the value associated with the given key if the key is in the symbol table
and
nullif the key is not in the symbol table - 抛出:
java.lang.IllegalArgumentException- ifkeyisnull
-
put
public void put(Key key, Value val)
Inserts the specified key-value pair into the symbol table, overwriting the old value with the new value if the symbol table already contains the specified key. Deletes the specified key (and its associated value) from this symbol table if the specified value isnull.- 参数:
key- the keyval- the value- 抛出:
java.lang.IllegalArgumentException- ifkeyisnull
-
deleteMin
public void deleteMin()
Removes the smallest key and associated value from the symbol table.- 抛出:
java.util.NoSuchElementException- if the symbol table is empty
-
deleteMax
public void deleteMax()
Removes the largest key and associated value from the symbol table.- 抛出:
java.util.NoSuchElementException- if the symbol table is empty
-
delete
public void delete(Key key)
Removes the specified key and its associated value from this symbol table (if the key is in this symbol table).- 参数:
key- the key- 抛出:
java.lang.IllegalArgumentException- ifkeyisnull
-
min
public Key min()
Returns the smallest key in the symbol table.- 返回:
- the smallest key in the symbol table
- 抛出:
java.util.NoSuchElementException- if the symbol table is empty
-
max
public Key max()
Returns the largest key in the symbol table.- 返回:
- the largest key in the symbol table
- 抛出:
java.util.NoSuchElementException- if the symbol table is empty
-
floor
public Key floor(Key key)
Returns the largest key in the symbol table less than or equal tokey.- 参数:
key- the key- 返回:
- the largest key in the symbol table less than or equal to
key - 抛出:
java.util.NoSuchElementException- if there is no such keyjava.lang.IllegalArgumentException- ifkeyisnull
-
ceiling
public Key ceiling(Key key)
Returns the smallest key in the symbol table greater than or equal tokey.- 参数:
key- the key- 返回:
- the smallest key in the symbol table greater than or equal to
key - 抛出:
java.util.NoSuchElementException- if there is no such keyjava.lang.IllegalArgumentException- ifkeyisnull
-
select
public Key select(int k)
Return the key in the symbol table whose rank isk. This is the (k+1)st smallest key in the symbol table.- 参数:
k- the order statistic- 返回:
- the key in the symbol table of rank
k - 抛出:
java.lang.IllegalArgumentException- unlesskis between 0 and n–1
-
rank
public int rank(Key key)
Return the number of keys in the symbol table strictly less thankey.- 参数:
key- the key- 返回:
- the number of keys in the symbol table strictly less than
key - 抛出:
java.lang.IllegalArgumentException- ifkeyisnull
-
keys
public java.lang.Iterable<Key> keys()
Returns all keys in the symbol table as anIterable. To iterate over all of the keys in the symbol table namedst, use the foreach notation:for (Key key : st.keys()).- 返回:
- all keys in the symbol table
-
keys
public java.lang.Iterable<Key> keys(Key lo, Key hi)
Returns all keys in the symbol table in the given range, as anIterable.- 参数:
lo- minimum endpointhi- maximum endpoint- 返回:
- all keys in the symbol table between
lo(inclusive) andhi(inclusive) - 抛出:
java.lang.IllegalArgumentException- if eitherloorhiisnull
-
size
public int size(Key lo, Key hi)
Returns the number of keys in the symbol table in the given range.- 参数:
lo- minimum endpointhi- maximum endpoint- 返回:
- the number of keys in the symbol table between
lo(inclusive) andhi(inclusive) - 抛出:
java.lang.IllegalArgumentException- if eitherloorhiisnull
-
height
public int height()
Returns the height of the BST (for debugging).- 返回:
- the height of the BST (a 1-node tree has height 0)
-
levelOrder
public java.lang.Iterable<Key> levelOrder()
Returns the keys in the BST in level order (for debugging).- 返回:
- the keys in the BST in level order traversal
-
main
public static void main(java.lang.String[] args)
Unit tests theBSTdata type.- 参数:
args- the command-line arguments
-
-