Assertion: tree's node | /r/CapableOf | replace existing leaf
Facets:
Source sentences:
text: The big difference is that in the binary search tree a new node is added as a leaf, whereas leaves contain no information in the red–black tree, so instead the new node replaces an existing leaf and then has two black leaves of its own added.