About: Left-leaning red–black tree

An Entity of Type: plant, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

A left-leaning red–black (LLRB) tree is a type of self-balancing binary search tree. It is a variant of the red–black tree and guarantees the same asymptotic complexity for operations, but is designed to be easier to implement.

Property Value
dbo:abstract
  • A left-leaning red–black (LLRB) tree is a type of self-balancing binary search tree. It is a variant of the red–black tree and guarantees the same asymptotic complexity for operations, but is designed to be easier to implement. (en)
  • 左傾紅黑樹（LLRB）是一種類型的自平衡二元搜尋樹。它是紅黑樹的變體，並保證對操作相同漸近的複雜性，但被設計成更容易實現。 (zh)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 35239409 (xsd:integer)
dbo:wikiPageLength
  • 6288 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1073220660 (xsd:integer)
dbo:wikiPageWikiLink
dbp:inventedBy
dbp:inventedYear
  • 2008 (xsd:integer)
dbp:name
  • Left-leaning red–black tree (en)
dbp:type
  • tree (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • A left-leaning red–black (LLRB) tree is a type of self-balancing binary search tree. It is a variant of the red–black tree and guarantees the same asymptotic complexity for operations, but is designed to be easier to implement. (en)
  • 左傾紅黑樹（LLRB）是一種類型的自平衡二元搜尋樹。它是紅黑樹的變體，並保證對操作相同漸近的複雜性，但被設計成更容易實現。 (zh)
rdfs:label
  • Left-leaning red–black tree (en)
  • 左倾红黑树 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License