TheAlgorithms / TheAlgorithms/PHP
Implement Red-Black Tree
Nobody has claimed this yet.
- Dominant language
- PHP
- Stars
- 2.6k
- Forks
- 584
- PR merge metrics
- No merged PRs in 30d
Description
Hello! I would like to contribute to this project for the first time as I'm new to open source.
I’d like to construct a Red-Black Tree data structure in the DataStructures directory, following the existing style and API conventions used in this repository.
Basic operations like insertion, delete, search, min max, and inorder are all part of the planned work. Unit tests to confirm insertion, deletion, and invariants; node rotations and color balancing to preserve Red-Black Tree characteristics. as well as usage-inspiring documentation.
I would like to get started on this and then submit a PR if there are no objections or ongoing implementations.
I appreciate your time and input 😄.
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 in the DataStructures directory by reviewing existing data-structure implementations to identify the repository's style and API conventions. Define the Red-Black Tree's insertion, deletion, search, min, max, and inorder behavior against those conventions. Done means the tree preserves its invariants, unit tests cover insertion and deletion, and usage documentation is included.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- php
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100