Loading repository data…
sachinv1693 / repository
A Red-Black Tree is a self balancing Binary Search Tree. It is useful in the Linux kernel design. For example in a process scheduler or for keeping track of the virtual memory segments for a process, it's used. It is also used in map, multimap, multiset from C++ STL and java.util.TreeMap , java.util.TreeSet from Java. Besides it's used in K-mean clustering algorithm for reducing time complexity. What’s more MySQL uses Red-Black Trees for indexes on tables. In this project, basic operations with Red-Black Tree like insertion, deletion, searching etc. are performed.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
In this project, basic operations on Red-Black Tree like insertion, deletion, searching etc. are performed. Run the makefile. Perform the given operations by selecting a particular option.
In Red-Black Tree insertion, we come across a problem of red-red parent-child relationship. In order to fix the issue, we need to perform some rotation &/or recoloring operations. Similarly, for delete operation, we have to fix double black issue while deleting a black node. In this project, recursive approach is used to fix the above issues. Finding a given node, finding minimum & maximum node operations are exactly similar to that in case of a BST. Output is printed in inorder manner. Any other way can also be used.
Red-Black Tree with n keys has the height: h <= 2 * log(n + 1). There is the assurance that its height remains as O(log n) after any sequence of deletions and insertions. So time complexity is fixed as it makes itself evenly distributed.
Selected from shared topics, language and repository description—not editorial ratings.
amitbansal7 /
Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.
62/100 healthtinloaf /
An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
72/100 healthxieqing /
A Red-black Tree Implementation In C
62/100 healthArsenShnurkov /
A collection of generic C# data structures, including an iterative binary search trees, an AVL tree, a red-black tree, a skip-list, and a min/max heap..
44/100 healthyasushi-saito /
An yet-another red-black tree implementation, with a C++ STL-like API.
43/100 healthdrogalis /
A vector based map that implements a red black tree under the hood. Performs faster insertions and deletions than std::map and has a reduced memory footprint per node.
73/100 health