title: Deletion in Left Leaning Red Black Trees
body: <p>I am learning about <a href="http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf" rel="noreferrer">Left Leaning Red Black Trees</a>.</p>
  
  <p>In the deletion algorithm peresented in the paper, if the key matches for a node and the right subtree is NULL for that node, then that node is deleted. But there may be a left subtree as well which is not considered.</p>
  
  <p>I am not able to understand <strong>why would the left subtree be NULL as well</strong>. Similar thing is done when deleting the minimum or the maximum as well. Could anyone please guide me on this?</p>