Function lwp_avl_find

components/lwp/lwp_avl.c:206–222

* @brief Finds a node in an AVL tree by key * * @param[in] key The key to search for in the AVL tree * @param[in] ptree Pointer to the root node of the AVL tree * * @return struct lwp_avl_struct* Pointer to the found node, or NULL if not found * * @note This function searches the AVL tree for a node with the specified key. * It performs a standard binary search by comparing keys and

 *       left or right subtrees accordingly.
 */
struct lwp_avl_struct *lwp_avl_find(avl_key_t key, struct lwp_avl_struct *ptree)
{
    for (;;)
    {
        if (ptree == AVL_EMPTY)
        {
            return (struct lwp_avl_struct *)0;
        }
        if (key == ptree->avl_key)
            break;
        if (key < ptree->avl_key)
            ptree = ptree->avl_left;
        else
            ptree = ptree->avl_right;
    }
    return ptree;
}

/**
 * @brief Recursively traverses an AVL tree and applies a function to each node