shz.st.bst.lxx

类 LXXRedBlackBST<K extends Comparable<K>>

java.lang.Object

shz.st.bst.RedBlackBST<K>

shz.st.bst.lxx.LXXRedBlackBST<K>

直接已知子类:

LDRedBlackBST, LFRedBlackBST, LIRedBlackBST, LJRedBlackBST, LLRedBlackBST

public abstract class LXXRedBlackBST<K extends Comparable<K>>
extends RedBlackBST<K>

健为K类型的红黑树

嵌套类概要

嵌套类

限定符和类型	类和说明
protected static class	LXXRedBlackBST.Node<K extends Comparable<K>>

字段概要

从类继承的字段 shz.st.bst.RedBlackBST

root

构造器概要

构造器

限定符	构造器和说明
protected	LXXRedBlackBST(LXXRedBlackBST.Node<K> root)

方法概要

限定符和类型	方法和说明
K	ceil(K key)
protected LXXRedBlackBST.Node<K>	ceil(LXXRedBlackBST.Node<K> h, K key)
K	floor(K key)
protected LXXRedBlackBST.Node<K>	floor(LXXRedBlackBST.Node<K> h, K key)
protected K	key(RedBlackBST.Node h)
Iterable<K>	keys() 查找所有键(中序遍历)
Iterable<K>	keys(K lo, K hi) 查找所有在区间[lo,hi]的键
protected void	keys(LXXRedBlackBST.Node<K> h, LLinkedQueue<K> queue)
protected void	keys(LXXRedBlackBST.Node<K> h, LLinkedQueue<K> queue, K lo, K hi)
Iterable<K>	keysGe(K lo) 查找所有不小于lo的键
protected void	keysGe(LXXRedBlackBST.Node<K> h, LLinkedQueue<K> queue, K lo)
Iterable<K>	keysLe(K hi) 查找所有不大于hi的键
protected void	keysLe(LXXRedBlackBST.Node<K> h, LLinkedQueue<K> queue, K hi)
int	size(K lo, K hi) 返回在区间[lo,hi]的节点数量
protected int	size(LXXRedBlackBST.Node<K> h, K lo, K hi)
int	sizeGe(K lo) 返回不小于lo的节点数量
protected int	sizeGe(LXXRedBlackBST.Node<K> h, K lo)
int	sizeLe(K hi) 返回不大于hi的节点数量
protected int	sizeLe(LXXRedBlackBST.Node<K> h, K hi)

从类继承的方法 shz.st.bst.RedBlackBST

balance, deleteMax, deleteMax, deleteMin, deleteMin, depth, depth, flipColors, isEmpty, isLeaf, isRed, max, max, min, min, moveRedLeft, moveRedRight, root, rotateLeft, rotateRight, select, select, size, size

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

构造器详细资料

LXXRedBlackBST

protected LXXRedBlackBST(LXXRedBlackBST.Node<K> root)

方法详细资料

key

protected final K key(RedBlackBST.Node h)

指定者:

key 在类中 RedBlackBST<K extends Comparable<K>>

sizeLe

public final int sizeLe(K hi)

返回不大于hi的节点数量

sizeLe

protected final int sizeLe(LXXRedBlackBST.Node<K> h,
                           K hi)

sizeGe

public final int sizeGe(K lo)

返回不小于lo的节点数量

sizeGe

protected final int sizeGe(LXXRedBlackBST.Node<K> h,
                           K lo)

size

public final int size(K lo,
                      K hi)

返回在区间[lo,hi]的节点数量

size

protected final int size(LXXRedBlackBST.Node<K> h,
                         K lo,
                         K hi)

floor

public final K floor(K key)

floor

protected final LXXRedBlackBST.Node<K> floor(LXXRedBlackBST.Node<K> h,
                                             K key)

ceil

public final K ceil(K key)

ceil

protected final LXXRedBlackBST.Node<K> ceil(LXXRedBlackBST.Node<K> h,
                                            K key)

keys

public final Iterable<K> keys()

查找所有键(中序遍历)

keys

protected final void keys(LXXRedBlackBST.Node<K> h,
                          LLinkedQueue<K> queue)

keysLe

public final Iterable<K> keysLe(K hi)

查找所有不大于hi的键

keysLe

protected final void keysLe(LXXRedBlackBST.Node<K> h,
                            LLinkedQueue<K> queue,
                            K hi)

keysGe

public final Iterable<K> keysGe(K lo)

查找所有不小于lo的键

keysGe

protected final void keysGe(LXXRedBlackBST.Node<K> h,
                            LLinkedQueue<K> queue,
                            K lo)

keys

public final Iterable<K> keys(K lo,
                              K hi)

查找所有在区间[lo,hi]的键

keys

protected final void keys(LXXRedBlackBST.Node<K> h,
                          LLinkedQueue<K> queue,
                          K lo,
                          K hi)