Complexity Analysis Station [4]

What is asymptotic complexity in the following function?

• O(n^2)

• O(n!)

• O(n log n)

• O(2^n)

You are looking for a specific value in a binary tree, but the tree is not a binary search tree. What is the time complexity of this?

What is the asymptotic complexity of the following function?

• O(n^2)

• O(logn)

• O(sqrt(n))

• O(n)

What is asymptotic complexity in the following function?

**Note that the function add_to_tree() has complexity O(logn), where n is the number of nodes in the tree.

What is asymptotic complexity in the following function? Where n is the number of nodes.

• O(n^2)

• O(nlogn)

• O(n^2logn)

• O(n)

What is the Big-O Notation of picking a sequence of 10 balls from a bag of 10 different coloured balls (the ball is not put back into the bag after being picked)?