title: What's the difference between a red black tree and a single runqueue?
body: <p>I have been trying to understand the difference between the two as they apply to different algorithms used to choose tasks to run in some CPU schedulers.</p>
  
  <p>What is the difference between an RB tree that places lowest time needed process on the left and chooses nodes from the left to run, and a queue that places them in a shortest job first order? </p>