Task: Implement a Purely Functional Balanced Binary Search Tree

Task: Implement a Purely Functional Balanced Binary Search Tree: a task in Terminal-Lego-15k (Harbor dataset). Purely functional data structures are fundamental to functional programming languages. In this task, you will implement a purely functional AVL tree (a self-balancing binary search tree)…

The task

Purely functional data structures are fundamental to functional programming languages. In this task, you will implement a purely functional AVL tree (a self-balancing binary search tree) in Python that supports efficient search, insertion, and merge operations.

Part of PrimeIntellect/Terminal-Lego-15k.