[#BloombergLP-bslalg-RbTreeUtil-previous-037]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslalg.adoc[bslalg]::xref:BloombergLP/bslalg/RbTreeUtil.adoc[RbTreeUtil]::previous
:relfileprefix: ../../../
:mrdocs:

`previous` overloads

== Synopses

Declared in `<bslalg_rbtreeutil.h>`

Return the modifiable node that precedes the specified `node`.


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

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

Return the address of the node that precedes the specified `node` in an in‐order traversal of the binary tree to which `node` belongs, or the tree's rightmost node if `node` is the sentinel node of the tree. The behavior is undefined unless or `node` is a non‐leftmost member of a valid binary tree or is a sentinel `node`. Note that if the tree does not contain duplicate values, then the returned node will have the largest value less than that of `node`.


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

[.small]#xref:BloombergLP/bslalg/RbTreeUtil/previous-03a.adoc[_» more..._]#


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