I am researching red black trees and areas in which red black trees are implemented. Some applications I know of are Completely Fair Scheduler in Linux Kern and finding items in frequent pattern mining, but I want to know more areas where red black trees are or can be implemented
Red-black tree is a kind of balanced tree (others are AVL-trees and 2-3-trees) and can be used everywhere where trees are used, usually for the fast element searches. E.g., it is used in some implementations of C++ STL (Standard Template Library) for sets and maps. I think the question is too general like "Where the (sorting/hashing/searching...) algorithm is used or can be used?". Almost everywhere :)
Red-black tree is a kind of balanced tree (others are AVL-trees and 2-3-trees) and can be used everywhere where trees are used, usually for the fast element searches. E.g., it is used in some implementations of C++ STL (Standard Template Library) for sets and maps. I think the question is too general like "Where the (sorting/hashing/searching...) algorithm is used or can be used?". Almost everywhere :)
Another example is the Java TreeMap.
http://docs.oracle.com/javase/7/docs/api/java/util/TreeMap.html
thank you for your response. i find some other applications of red=-black trees. i would like to share
K-mean Clustering using red black tree, Databases, Simple-minded database, searching words inside dictionaries, searching on web.
- Badges
- Science topic
- Similar topics
- Computer Science
- Data Mining