STL's Red-Black Trees

by Jason Shankel



Example 1:



template <class Key, class Value, class  KeyOfValue, class Compare>

class rb_tree

{...};



Example 2:



iterator __insert(link_type x,link_type y,value &v);

	 x is a pointer to the node being replaced

	 y is a pointer to x's parent 

	 v is the value.  







6





