Left-leaning red–black tree
id:
left-leaning-red-black-tree-210-4459923
title:
Left-leaning red–black tree
text:
A left-leaning red–black (LLRB) tree is a type of self-balancing binary search tree, introduced by Robert Sedgewick. 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.
brand slug:
wiki
category slug:
encyclopedia
description:
Self-balancing binary search tree data structure
original url:
https://en.wikipedia.org/wiki/Left-leaning_red%E2%80%93black_tree
date created:
2012-03-27T14:03:00Z
date modified:
2024-09-11T20:20:43Z
main entity:
{"identifier":"Q6516757","url":"https://www.wikidata.org/entity/Q6516757"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/ae/Left-leaning_red%E2%80%93black_tree.png","width":678,"height":505}
fields total:
13
integrity:
16