A decision tree with n2 leaves always has height O(log(n²)). An algorithm can finish before it reaches a leaf in its decision tree. The decision tree of an algorithm with n distinct possible outputs...

Select all true statements

Extracted text: A decision tree with n2 leaves always has height O(log(n²)). An algorithm can finish before it reaches a leaf in its decision tree. The decision tree of an algorithm with n distinct possible outputs can have 2n leaves. The running time of an algorithm with a decision tree of height n can be w(n).