[#BloombergLP-bslalg-RbTreeUtil-rightmost-023]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslalg.adoc[bslalg]::xref:BloombergLP/bslalg/RbTreeUtil.adoc[RbTreeUtil]::rightmost
:relfileprefix: ../../../
:mrdocs:

`rightmost` overloads

== Synopses

Declared in `<bslalg_rbtreeutil.h>`

Same as the preceding `rightmost` overload, returning a modifiable node.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
static
xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode]*
xref:BloombergLP/bslalg/RbTreeUtil/rightmost-020.adoc[rightmost](xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode]* subtree);
----

[.small]#xref:BloombergLP/bslalg/RbTreeUtil/rightmost-020.adoc[_» more..._]#

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).


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
static
xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode] const*
xref:BloombergLP/bslalg/RbTreeUtil/rightmost-025.adoc[rightmost](xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode] const* subtree);
----

[.small]#xref:BloombergLP/bslalg/RbTreeUtil/rightmost-025.adoc[_» more..._]#


[.small]#Created with https://www.mrdocs.com[MrDocs]#