Closed purnima2904 closed 1 month ago
🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.
Feel free to join our community on Discord to discuss more!
✅ This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!
Have you completed your first issue?
Guidelines
Latest Merged PR Link
901
Project Description
A Red-Black Tree is a type of self-balancing binary search tree that ensures efficient performance for search, insert, and delete operations, which all occur in O(logn) time complexity. Red-Black Trees are used in many applications requiring balanced search trees, including databases and the Linux kernel, due to their predictable balance properties and relatively simple balancing mechanism compared to AVL Trees.
Full Name
Purnima Gupta
Participant Role
GSSOC Level 3