For the computer science genius (Time complexity)?

Question

What is the Time complexity for the
- best case
- worst case
- average case
for multiway tree?

Answer 1

it depends on which algorithm to use.
i think your problem is about AI questions.

there are different main algorithms to solve a problem in AI.

and the complexity of them depends on the problem. any problem may have different complexity.

Answer 2

A application with a great O(logn) is once you would be finding an merchandise in a binary seek tree. huge O (nlogn) is doing a sort which incorporate a heapsort. via the way the previous answer grew to become into incorrect the traveling salesmen could be huge O(n!)