多选题

Which of the following statements are true?

Question

A. We can create a binary tree from given inorder and preorder traversal sequences.

B. We can create a binary tree from given preorder and postorder traversal sequences.

C. For an almost sorted array, insertion sort can be more effective than Quicksort.

D. Suppose T(n) is the runtime of resolving a problem with n elements, T(n) = &Theta(1) if n = 1 T(n) = 2T(n/2) + &Theta(n) if > 1 so T(n) is &Theta(n log n).

E. None of the above.