Îõ³h*Þ ¶(      !"#$%&'0.0.5 Safe-Inferred t1RBTree!Interval value from -INF to +INF.RBTreepositive infinityRBTreepositive infinityRBTree!Normal value, not need to be Ord.RBTreeused for range query.(RBTree RBTree in a Zip mode.ÂCurrent Node can start from any node inside the tree, with a Path back to Root node. RBZip is equivalent to RBTree in Logic. All RBZip can be convert to a RBTree by Trace back to Root point.)RBTreeRBZip sub-tree path*RBTreeA Path is a series of Steps.+RBTreeÅRecords the one step from a parent node to one of its children nodes.,RBTree%Represents the direction of one step.RBTreeBasic RBTree Structure.RBTree0A Node that holds an element and has two leaves.RBTree A Black leaf. RBTree Color of a  . Leaf is assumed to be Black. RBTreeGen an empty Tree.-RBTreeÀGet the root node Color of current sub-tree, Leaf is also Black..RBTreeSet current Root to Black./RBTreeSet current Root to Red.0RBTreeConversion : RBTree <==> RBZip.1RBTreeconvert a zip to tree.2RBTreeZip up.3RBTreeÈGet the Left-most non-leaf node from a Zip, or get Leaf if it is a Leaf.4RBTreeÉGet the Right-most non-leaf node from a Zip, or get Leaf if it is a Leaf.5RBTreeîZip up until the sub-tree has a left-parent, used to find the biggest lower-order element of the current node.6RBTreeðZip up until the sub-tree has a right-parent, used to find the smallest upper-order element of the current node.7RBTree find predecessor of a node/leaf.8RBTree find predecessor of a node/leaf.9RBTree5Get the Leftmost non-leaf node's value from a Zip. [param 1] current node's value. [param 2] current node's left child. RBTreeInsert 'Ord' things.RBTreeInsert a bunch of 'Ord' things.RBTree:Insert anything. |you have to provide a compare function.RBTreeInsert Operator for insertOrdRBTreeSearch for 'Ord' things. see RBTreeÁsearch for any thing, you should provide proper compare function.RBTreeSearch operator for searchOrdRBTree a faster . function implemetation. strongly recommanded.RBTreeËSearch the Maximum value in the tree, equals to get the right-most element.RBTreeÊSearch the Minimum value in the tree, equals to get the left-most element.RBTreeSearch 'Ord' things, see RBTreeSearch for a Interval. For example: tree has 1,3,5,7. search for 3 returns [3,3] that indicates itself search for 4 returns [3,5] indicates that 4 is between the element 3 and 54The given value be or not be an element of the tree.RBTreeDelete an 'Ord' thing. see .RBTreeDelete a sequence of elements.RBTreeÊIf there is no relevant element in tree, tree will be returned unmodified.RBTreeDelete Operator for deleteOrd:RBTreefixup.RBTreeÚVerify black-depth are all the same. Return Just 'depth' on success, otherwise Nothing.RBTree4vR : verify no 'red-red' pattern in x and x's parentRBTreeÂfor distinguish Red/Black, show '*' for Red and nothing for Black. RBTree7Simply show tree in (), hard to read but easy to parse.      ;      !"#$%&'())*+,-./0123456789:;#RBTree-0.0.5-Log36dE9yM3J7nrhk8Jv6PData.Tree.RBTreeRBTreeRealOrd PInfinity NInfinity RealValueIntervalNodeLeafColorRedBlackemptyRB insertOrd insertOrdListinsert<