[#BloombergLP-bslalg-RbTreeUtil-leftmost-03]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslalg.adoc[bslalg]::xref:BloombergLP/bslalg/RbTreeUtil.adoc[RbTreeUtil]::leftmost
:relfileprefix: ../../../
:mrdocs:

`leftmost` overloads

== Synopses

Declared in `&lt;bslalg&lowbar;rbtreeutil&period;h&gt;`

Return the address of the leftmost node in the specified `subtree`, and `subtree` if `subtree` has no left child&period;


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

[.small]#xref:BloombergLP/bslalg/RbTreeUtil/leftmost-0e.adoc[_» more&period;&period;&period;_]#

Return the address of the leftmost node in the specified `subtree`, and `subtree` if `subtree` has no left child&period; The behavior is undefined unless `0 !&equals; subtree`, and `subtree` refers to a valid binary tree&period; Note that the value held by the returned node will not compare greater than that of any other node in `subtree` (as determined by the comparator used to organize the red&hyphen;black subtree data)&period;


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

[.small]#xref:BloombergLP/bslalg/RbTreeUtil/leftmost-09.adoc[_» more&period;&period;&period;_]#


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