Function lwp_avl_traversal

components/lwp/lwp_avl.c:237–267

* @brief Recursively traverses an AVL tree and applies a function to each node * * @param[in] ptree Pointer to the root node of the AVL tree * @param[in] fun Callback function to apply to each node * @param[in,out] arg Additional argument passed to the callback function * * @return int Returns the last result from the callback function (0 if all nodes processed) * * @note This function per

 *       if the callback returns a non-zero value.
 */
int lwp_avl_traversal(struct lwp_avl_struct *ptree, int (*fun)(struct lwp_avl_struct *, void *), void *arg)
{
    int ret;

    if (!ptree)
    {
        return 0;
    }
    if (ptree->avl_left)
    {
        ret = lwp_avl_traversal(ptree->avl_left, fun, arg);
        if (ret != 0)
        {
            return ret;
        }
    }
    ret = (*fun)(ptree, arg);
    if (ret != 0)
    {
        return ret;
    }
    if (ptree->avl_right)
    {
        ret = lwp_avl_traversal(ptree->avl_right, fun, arg);
        if (ret != 0)
        {
            return ret;
        }
    }
    return ret;
}

/**
 * @brief Finds the first (leftmost) node in an AVL tree