Mmabiaa / Mmabiaa/Data-Structure-And-Algorithms-Java
Implement an AVL Tree
Open
Nobody has claimed this yet.
enhancement
help wanted
- Dominant language
- Java
- Stars
- 3
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
Description: Request the addition of an AVL Tree implementation to maintain balanced binary search trees with rotations during insertions and deletions.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the repository's existing data-structure implementations and conventions. Define the work as an AVL tree supporting balanced insertions and deletions through rotations, then verify that both operations preserve the tree's balance and search-tree behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- data
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100