Implement Additional Data Structures

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

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
35/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
python
Domain
data

Research direction

The issue names B-Trees, AVL Trees, Red-Black Trees, Segment Trees, and Disjoint Set Union, but no files or tests. Start by reviewing the repository’s existing Python data-structure implementations and documentation conventions; done means all five structures are implemented and documented.

Written by the indexing model from the issue text.

Description

enhancement help wanted
  • Description: Implement and document additional data structures such as:
    • B-Trees
    • AVL Trees
    • Red-Black Trees
    • Segment Trees
    • Disjoint Set Union (Union-Find)
Dominant language
Python
Stars
5
Forks
1
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

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/dsa_In_python

All issues in Mmabiaa/dsa_In_python

Similar issues

More Python issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.