internal RBNode(RBTree.Color color, IComparable item, RBNode p, RBNode left, RBNode right) { this.color=color; this.p=p; this.left=left; this.right=right; this.item=item; }
internal RBTree Clone() { RBTree clone = new RBTree(); foreach (IComparable n in this) { clone.insert(n); } return(clone); }
internal PriorityQueue() { tree=new RBTree(); }
internal RBTreeEnumerator(RBTree tree) { this.tree=tree; Reset(); }
internal RBNode(RBTree.Color color) { this.color=color; }
internal RBTree Clone() { RBTree clone=new RBTree(); foreach(IComparable n in this) { clone.insert(n); } return clone; }
internal PriorityQueue() { tree = new RBTree(); }
internal RBTreeEnumerator(RBTree tree) { this.tree = tree; Reset(); }