bst_node_t *bst_iter_start(bst_t *bst, unsigned char ascending) {
bst->iter_asc = ascending;
bst_node_t *n;
if (TRUE == bst->iter_asc) {
bst->iter_node = bst_min_node(bst);
} else {
bst->iter_node = bst_max_node(bst);
}
return bst->iter_node;
}
static SR_INLINE const tree_node_ptr bst_min_node_const(const tree_node_ptr PARAM_IN root_node_ptr)
{
return bst_min_node((tree_node_ptr)root_node_ptr);
}
