shz.st.bst

类 RedBlackBST<K extends Comparable<K>>

java.lang.Object

shz.st.bst.RedBlackBST<K>

直接已知子类:

IXXRedBlackBST, JXXRedBlackBST, LXXRedBlackBST

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

红黑二叉查找树（红黑树，2-3树的一种等价定义）

在一棵大小为N的2-3树中，查找和插入操作访问的结点必然不超过lgN个

满足条件： 1：红链接均为左链接 2：没有任何一个结点同时和两条红链接相连 3：该树是完美黑色平衡的，即任意空链接到根结点的路径上的黑链接数量相同 4：根结点总是黑色

一棵大小为N的红黑树的高度不会超过2lgN 一棵大小为N的红黑树中，根结点到任意结点的平均路径长度为～1.00lgN

嵌套类概要

嵌套类

限定符和类型	类和说明
protected static class	RedBlackBST.Node

字段概要

字段

限定符和类型	字段和说明
protected RedBlackBST.Node	root

构造器概要

构造器

限定符	构造器和说明
protected	RedBlackBST(RedBlackBST.Node root)

方法概要

限定符和类型	方法和说明
protected <T extends RedBlackBST.Node> T	balance(RedBlackBST.Node h)
void	deleteMax()
protected <T extends RedBlackBST.Node> T	deleteMax(RedBlackBST.Node h)
void	deleteMin()
protected <T extends RedBlackBST.Node> T	deleteMin(RedBlackBST.Node h)
int	depth() 树的高度
protected int	depth(RedBlackBST.Node h)
protected void	flipColors(RedBlackBST.Node h)
boolean	isEmpty()
boolean	isLeaf()
protected boolean	isRed(RedBlackBST.Node h)
protected abstract K	key(RedBlackBST.Node h)
K	max()
protected <T extends RedBlackBST.Node> T	max(RedBlackBST.Node h)
K	min()
protected <T extends RedBlackBST.Node> T	min(RedBlackBST.Node h)
protected <T extends RedBlackBST.Node> T	moveRedLeft(RedBlackBST.Node h)
protected <T extends RedBlackBST.Node> T	moveRedRight(RedBlackBST.Node h)
protected <T extends RedBlackBST.Node> T	root()
protected <T extends RedBlackBST.Node> T	rotateLeft(RedBlackBST.Node h)
protected <T extends RedBlackBST.Node> T	rotateRight(RedBlackBST.Node h)
K	select(int k) 返回排名为k的节点
protected <T extends RedBlackBST.Node> T	select(RedBlackBST.Node h, int k)
int	size()
protected int	size(RedBlackBST.Node h)

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

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

字段详细资料

root

protected RedBlackBST.Node root

构造器详细资料

RedBlackBST

protected RedBlackBST(RedBlackBST.Node root)

方法详细资料

root

protected final <T extends RedBlackBST.Node> T root()

size

public final int size()

size

protected final int size(RedBlackBST.Node h)

isEmpty

public final boolean isEmpty()

isLeaf

public final boolean isLeaf()

isRed

protected final boolean isRed(RedBlackBST.Node h)

rotateLeft

protected final <T extends RedBlackBST.Node> T rotateLeft(RedBlackBST.Node h)

rotateRight

protected final <T extends RedBlackBST.Node> T rotateRight(RedBlackBST.Node h)

flipColors

protected final void flipColors(RedBlackBST.Node h)

key

protected abstract K key(RedBlackBST.Node h)

min

public final K min()

min

protected final <T extends RedBlackBST.Node> T min(RedBlackBST.Node h)

max

public final K max()

max

protected final <T extends RedBlackBST.Node> T max(RedBlackBST.Node h)

depth

public final int depth()

树的高度

depth

protected final int depth(RedBlackBST.Node h)

select

public final K select(int k)

返回排名为k的节点

select

protected final <T extends RedBlackBST.Node> T select(RedBlackBST.Node h,
                                                      int k)

deleteMin

public final void deleteMin()

deleteMin

protected final <T extends RedBlackBST.Node> T deleteMin(RedBlackBST.Node h)

moveRedLeft

protected final <T extends RedBlackBST.Node> T moveRedLeft(RedBlackBST.Node h)

balance

protected final <T extends RedBlackBST.Node> T balance(RedBlackBST.Node h)

deleteMax

public final void deleteMax()

deleteMax

protected final <T extends RedBlackBST.Node> T deleteMax(RedBlackBST.Node h)

moveRedRight

protected final <T extends RedBlackBST.Node> T moveRedRight(RedBlackBST.Node h)