# Red-black tree

> A balanced binary search tree with red and black nodes, styled with one key per color. A forest example with its LaTeX source.

A forest example in the TeXeR TikZ library: https://texer.org/library/forest/red-black-tree

Package: [forest](https://texer.org/library/forest.md), on CTAN at https://ctan.org/pkg/forest.

Tags: red-black tree, balanced tree, data structure

## Source

```latex
\usepackage{forest}

\begin{forest}
  for tree={
    circle, draw, fill=black, text=white, font=\small\bfseries,
    minimum size=7mm, inner sep=0pt, s sep=5mm, l sep=3mm,
  },
  red/.style={fill=red!75!black, draw=red!75!black},
  [13
    [8, red
      [1
        [, phantom]
        [6, red]
      ]
      [11]
    ]
    [17, red
      [15]
      [25
        [22, red]
        [27, red]
      ]
    ]
  ]
\end{forest}
```

## As a complete document

The same example in a document that compiles on its own with pdfLaTeX:

```latex
\documentclass[margin=3mm]{standalone}
\usepackage{tikz}
\usepackage{xcolor}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{forest}

\begin{document}

\begin{forest}
  for tree={
    circle, draw, fill=black, text=white, font=\small\bfseries,
    minimum size=7mm, inner sep=0pt, s sep=5mm, l sep=3mm,
  },
  red/.style={fill=red!75!black, draw=red!75!black},
  [13
    [8, red
      [1
        [, phantom]
        [6, red]
      ]
      [11]
    ]
    [17, red
      [15]
      [25
        [22, red]
        [27, red]
      ]
    ]
  ]
\end{forest}
\end{document}
```
