Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Left-leaning_red–black_tree> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Left-leaning_red–black_tree 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.".
- Left-leaning_red–black_tree wikiPageID "35239409".
- Left-leaning_red–black_tree wikiPageRevisionID "597216670".
- Left-leaning_red–black_tree deleteAvg "O".
- Left-leaning_red–black_tree deleteWorst "O".
- Left-leaning_red–black_tree insertAvg "O".
- Left-leaning_red–black_tree insertWorst "O".
- Left-leaning_red–black_tree inventedBy Robert_Sedgewick_(computer_scientist).
- Left-leaning_red–black_tree inventedYear "2008".
- Left-leaning_red–black_tree name "Left-leaning red–black tree".
- Left-leaning_red–black_tree searchAvg "O".
- Left-leaning_red–black_tree searchWorst "O".
- Left-leaning_red–black_tree spaceAvg "O".
- Left-leaning_red–black_tree spaceWorst "O".
- Left-leaning_red–black_tree type "tree".
- Left-leaning_red–black_tree subject Category:Trees_(data_structures).
- Left-leaning_red–black_tree 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.".
- Left-leaning_red–black_tree label "Left-leaning red–black tree".
- Left-leaning_red–black_tree sameAs Left-leaning_red%E2%80%93black_tree.
- Left-leaning_red–black_tree sameAs Q6516757.
- Left-leaning_red–black_tree sameAs Q6516757.
- Left-leaning_red–black_tree wasDerivedFrom Left-leaning_red–black_tree?oldid=597216670.