Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

Implement an AVL Tree

Open
#7 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
4/5
Estimated time
3-5 days
Newbie friendliness
35/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
java
Domain
data

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.

Description

enhancement help wanted

Description: Request the addition of an AVL Tree implementation to maintain balanced binary search trees with rotations during insertions and deletions.

Dominant language
Java
Stars
3
Forks
0
PR merge metrics
No merged PRs in 30d

Getting set up

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from Mmabiaa/Data-Structure-And-Algorithms-Java

All issues in Mmabiaa/Data-Structure-And-Algorithms-Java

Similar issues

More Java issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.