HF RL Explorer

Task: Implement and Compare Trie and Suffix Tree Data Structures

Task: Implement and Compare Trie and Suffix Tree Data Structures: a task in Terminal-Lego-15k (Harbor dataset). You need to implement both a Trie (Prefix Tree) and a Suffix Tree data structure to demonstrate their differences and use cases. This task will help you understand how these two related…

The task

You need to implement both a **Trie (Prefix Tree)** and a **Suffix Tree** data structure to demonstrate their differences and use cases. This task will help you understand how these two related but distinct data structures work.

Part of PrimeIntellect/Terminal-Lego-15k.