What is the minimum number of nodes in binary tree with height 3 (assuming root is at height 0)? Briefly explain your answer.
3, minimum number of nodes is height
List the following formulas in order of running time analysis, from greatest to least time requirements:
n2+1 50 log n XXXXXXXXXX10n+10000
n^2 +1, 10n XXXXXXXXXX, 50logn, XXXXXXXXXX
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here