9, Nil, 10, Nil, Nil, 7, 3, Nil, 12

9, Nil, 10, 3, Deleted, 7, 12, Nil, Nil

9, Nil, 10, 12, Deleted, 7, 3, Nil, Nil

9, Nil, 10, 12, Nil, 7, 3, Nil, Nil

9, Nil, 10, Nil, Nil, 7, 3, 12, Nil

9, Nil, 10, 3, Nil, 7, 12, Nil, Nil

9, Nil, 10, Nil, Deleted, 7, 3, Nil, 12

The result of returns the tree .

The result of returns the tree .

The result of returns the tree.

is a binary search tree. 

The result of returns the tree . 

Considering the asymptotic time and space complexity in the worst case, HeapSort is a better algorithm than MergeSort. 

Inserting a new element at the start of a sequence (adding a new head in front of the current one) can be done more efficiently when using a doubly-linked list than when using an array.

In topological sorting, depth-first search could be safely replaced by breath-first search (with finishing time of being recorded when the node turns black).  

A graph always has strictly more nodes than strongly connected components.

RB-Delete-Fixup preserves the (real) height of the tree. 

can be solved using Case 1 of the Master Theorem

cannot be solved using the Master Theorem

can be solved using Case 2 of the Master Theorem

can be solved using Case 3 of the Master Theorem