Which of the following BST traversals require (n) operations?

Multiple answers: You can select more than one option

A) Pre-Order

B) Post-Order

C) In-Order

D) Reverse-Order

E) Level-Order

****************

Which are true of an m-ary B-Tree?

Multiple answers: You can select more than one option

A) Every node has at most m children

B) Every node has exactly m children

C) Every node has at least m children

D) Every non-leaf node has exactly one key per child

)E None of the above

********************

Which are true about the time complexity of the BST, AVL Tree, and B-Tree for search?

Multiple answers: You can select more than one option

A) BST has average case of (log n)

B) AVL Tree has average case of (log n)

C) B-Tree has average case of (log n)

D) BST has worst case of (n)

E) AVL Tree has worst case of (n)

F) B-Tree has worst case of (n)