OpenGenus/cosmos

Add Red Black Binary Search Tree

Open

#5,949 opened on Oct 3, 2020

View on GitHub
 (2 comments) (2 reactions) (1 assignee)C++ (3,724 forks)batch import
Hacktoberfest

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

This is a(n):

  • New algorithm
  • Update to an existing algorithm
  • Error
  • Proposal to the Repository

Details:

The tree folder is missing Red Black BST data structure. Red Black Binary Search tree is similar to an AVL tree but in this data structure every operation is guaranteed O(clgn), where c is some constant. It is a very important data structure as every operation is really fast and much easier to understand than AVL tree. I would like to add a Red Black BST written in python.

Contributor guide

Research direction
Tech stack
Domain
Issue type
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Prerequisites
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.