1.什么是2-3数
2.什么是红黑树
红黑树的简单框架:
class RBT1<E> where E : IComparable<E>
{
private const bool Red = true;
private const bool Black = false;
private class Node
{
public E e;
public Node left;
public Node right;
public bool color;
public Node(E e)
{
this.e = e;
left = null;
right = null;
color = Red;
}
}
private Node root;
private int N;
public RBT1()