My understanding of the access patterns for CFS are as below
- Pick the process with the least vruntime
- Add a new process
- Change vruntime of a particular process
For the above access patterns Binary Heap seems to be a better data structure than Red Black Tree due to the time taken for picking the process with the least vruntime.