HF RL Explorer

Task: Implement an Immutable Deque as a Balanced Binary Tree

Task: Implement an Immutable Deque as a Balanced Binary Tree: a task in Terminal-Lego-15k (Harbor dataset). Implement an immutable deque (double-ended queue) data structure using a balanced binary tree in a functional programming style. The deque should allow efficient insertion and removal of…

The task

Implement an immutable deque (double-ended queue) data structure using a balanced binary tree in a functional programming style. The deque should allow efficient insertion and removal of elements from both the front and back ends while maintaining immutability—all modification operations should return new data…

Part of PrimeIntellect/Terminal-Lego-15k.