[FEATURE REQUEST] Add Treap class in java
Opened this issue · 3 comments
What would you like to Propose?
What would I like to propose?
A treap (short for "tree heap") is a type of balanced binary search tree that combines properties of both a binary search tree and a heap. It ensures that the tree remains balanced during operations like insertion and deletion, achieving good average-case time complexities for these operations.
Issue details
Issue details
The repository currently lacks implementation of Treap`
Additional Information
No response
Title:
"Add Treap Data Structure to the Repository"
Description:
I would like to propose the addition of the Treap (Tree Heap) data structure to the repository. A Treap is a randomized binary search tree that maintains the binary search tree property on the keys and a heap property on random priorities assigned to each node. This ensures that the tree remains balanced with an average-case time complexity of O(log n) for insertion, deletion, and search operations.
Why It’s Needed:
Currently, the repository does not include an implementation of a self-balancing binary search tree like a Treap. This data structure can be useful in situations where efficient insertion, deletion, and search operations are needed while keeping the structure simple and randomized, avoiding the complexity of manually balancing trees (e.g., AVL or Red-Black Trees).
Proposed Features:
- Insert: Add a node by maintaining both the binary search tree and heap properties.
- Delete: Remove a node while maintaining both properties.
- Search: Perform standard binary search tree operations for key lookups.
Documentation:
I will provide clear inline comments and documentation explaining the purpose and use of the Treap. This will include examples of how to use the data structure.
Looks good, let's add it