Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Red–black_tree> ?p ?o. }

• Red–black_tree abstract "A red–black tree is a data structure which is a type of self-balancing binary search tree.Balance is preserved by painting each node of the tree with one of two colors (typically called 'red' and 'black') in a way that satisfies certain properties, which collectively constrain how unbalanced the tree can become in the worst case. When the tree is modified, the new tree is subsequently rearranged and repainted to restore the coloring properties. The properties are designed in such a way that this rearranging and recoloring can be performed efficiently.The balancing of the tree is not perfect but it is good enough to allow it to guarantee searching in O(log n) time, where n is the total number of elements in the tree. The insertion and deletion operations, along with the tree rearrangement and recoloring, are also performed in O(log n) time.Tracking the color of each node requires only 1 bit of information per node because there are only two colors. The tree does not contain any other data specific to its being a red–black tree so its memory footprint is almost identical to a classic (uncolored) binary search tree. In many cases the additional bit of information can be stored at no additional memory cost.".
• Red–black_tree wikiPageID "26397".
• Red–black_tree wikiPageRevisionID "604654154".
• Red–black_tree deleteAvg "O".
• Red–black_tree deleteWorst "O".
• Red–black_tree id "_VbTnLV8plU".
• Red–black_tree insertAvg "O".
• Red–black_tree insertWorst "O".
• Red–black_tree inventedBy Rudolf_Bayer.
• Red–black_tree inventedYear "1972".
• Red–black_tree name "Red–black tree".
• Red–black_tree searchAvg "O".
• Red–black_tree searchWorst "O".
• Red–black_tree spaceAvg "O".
• Red–black_tree spaceWorst "O".
• Red–black_tree title "Binary Search Tree Insertion Visualization".
• Red–black_tree type "tree".
• Red–black_tree subject Category:1972_in_computer_science.
• Red–black_tree subject Category:Articles_containing_proofs.
• Red–black_tree subject Category:Articles_with_example_C_code.
• Red–black_tree subject Category:Binary_trees.
• Red–black_tree comment "A red–black tree is a data structure which is a type of self-balancing binary search tree.Balance is preserved by painting each node of the tree with one of two colors (typically called 'red' and 'black') in a way that satisfies certain properties, which collectively constrain how unbalanced the tree can become in the worst case. When the tree is modified, the new tree is subsequently rearranged and repainted to restore the coloring properties.".
• Red–black_tree label "Arbre bicolore".
• Red–black_tree label "Drzewo czerwono-czarne".
• Red–black_tree label "RB-Albero".
• Red–black_tree label "Red–black tree".
• Red–black_tree label "Rood-zwartboom".
• Red–black_tree label "Rot-Schwarz-Baum".
• Red–black_tree label "Árbol rojo-negro".
• Red–black_tree label "Árvore rubro-negra".
• Red–black_tree label "Красно-чёрное дерево".
• Red–black_tree label "红黑树".
• Red–black_tree label "赤黒木".
• Red–black_tree sameAs Red%E2%80%93black_tree.
• Red–black_tree sameAs Červeno-černý_strom.
• Red–black_tree sameAs Rot-Schwarz-Baum.
• Red–black_tree sameAs Árbol_rojo-negro.
• Red–black_tree sameAs Arbre_bicolore.
• Red–black_tree sameAs Pohon_merah-hitam.
• Red–black_tree sameAs RB-Albero.
• Red–black_tree sameAs 赤黒木.
• Red–black_tree sameAs 레드-블랙_트리.
• Red–black_tree sameAs Rood-zwartboom.
• Red–black_tree sameAs Drzewo_czerwono-czarne.
• Red–black_tree sameAs Árvore_rubro-negra.
• Red–black_tree sameAs Q506496.
• Red–black_tree sameAs Q506496.
• Red–black_tree wasDerivedFrom Red–black_tree?oldid=604654154.