Editing Red–black tree (section)

== External links ==
*{{anchor|Pfaff a}}Ben Pfaff: ''An Introduction to Binary Search Trees and Balanced Trees.'' Free Software Foundation, Boston 2004, [https://ftp.gnu.org/gnu/avl/avl-2.0.3.pdf.gz ftp.gnu.org] (PDF gzip; 1662&nbsp;kB)
*[https://web.archive.org/web/20140328232325/http://en.literateprograms.org/Red-black_tree_(C) A complete and working implementation in C]
*[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/lecture-10-red-black-trees-rotations-insertions-deletions/ OCW MIT Lecture on Red-black Trees] by [[Erik Demaine]] 
*{{YouTube|id=_VbTnLV8plU|title=Binary Search Tree Insertion Visualization}} – Visualization of random and pre-sorted data insertions, in elementary binary search trees, and left-leaning red–black trees
*[https://gist.github.com/pallas/10697727 An intrusive red–black tree written in C++]
*Red–black BSTs in [https://algs4.cs.princeton.edu/33balanced/ 3.3 Balanced Search Trees]
*[https://web.archive.org/web/20160722175219/http://algs4.cs.princeton.edu/lectures/33DemoRedBlackBST.mov Red–black BST Demo]

{{CS-Trees}}
{{Data structures}}

{{DEFAULTSORT:Red-Black Tree}}
[[Category:Binary trees]]
[[Category:Search trees]]
[[Category:Amortized data structures]]
[[Category:1972 in computing]]
[[Category:Articles containing proofs]]
[[Category:Articles with example C code]]