Return the address of the leftmost node in the specified subtree, and subtree if subtree has no left 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 greater than that of any other node in subtree (as determined by the comparator used to organize the red-black subtree data).
Declared in <bslalg_rbtreeutil.h>
static
RbTreeNode const*
leftmost(RbTreeNode const* subtree);