Function lwp_avl_insert

components/lwp/lwp_avl.c:168–192

* @brief Inserts a new node into an AVL tree while maintaining balance * * @param[in] new_node The new node to be inserted into the AVL tree * @param[in,out] ptree Pointer to the root node pointer of the AVL tree * * @note Uses a stack to track the insertion path for rebalancing */

 * @note Uses a stack to track the insertion path for rebalancing
 */
void lwp_avl_insert(struct lwp_avl_struct *new_node, struct lwp_avl_struct **ptree)
{
    avl_key_t key = new_node->avl_key;
    struct lwp_avl_struct **nodeplace = ptree;
    struct lwp_avl_struct **stack[avl_maxheight];
    int stack_count = 0;
    struct lwp_avl_struct ***stack_ptr = &stack[0]; /* = &stack[stackcount] */
    for (;;)
    {
        struct lwp_avl_struct *node = *nodeplace;
        if (node == AVL_EMPTY)
            break;
        *stack_ptr++ = nodeplace;
        stack_count++;
        if (key < node->avl_key)
            nodeplace = &node->avl_left;
        else
            nodeplace = &node->avl_right;
    }
    new_node->avl_left = AVL_EMPTY;
    new_node->avl_right = AVL_EMPTY;
    new_node->avl_height = 1;
    *nodeplace = new_node;
    lwp_avl_rebalance(stack_ptr, stack_count);
}

/**
 * @brief Finds a node in an AVL tree by key