rightmost overloads
Synopses
Declared in <bslalg_rbtreeutil.h>
Same as the preceding rightmost overload, returning a modifiable node.
static
RbTreeNode*
rightmost(RbTreeNode* subtree);
Return the address of the rightmost node in the specified subtree, and subtree if subtree has no right child. The behavior is undefined unless 0 != subtree and subtree refers to a valid binary tree. Note that the value held by the returned node will not compare less than that of any other node in subtree (as determined by the comparator used to organize the red‐black subtree data).
static
RbTreeNode const*
rightmost(RbTreeNode const* subtree);
Created with MrDocs