Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as Correct Answer log3/2 n

Total number of nodes can be described by the recurrence T(n) = T((n-1)/3)) + T(2(n-1)/3) + 1 T(1) = 1. height of the tree will be H(n) = H(2/3(n-1)) + 1, H(1). drawing a recurrence tree and the cost at each level is 1 and the height will be log(3/2)n.

Related Questions

Let X1, X2 be two independent normal random variables with means μ1, μ2 and standard deviations σ1, σ2 respectively. Consider Y = X1 - X2; μ1 = μ2 = 1, σ1 = 1, σ2 = 2, Then,
Consider the following system of equations in three real variables x1, x2 and x3
2x1 - x2 + 3x3 = 1
3x1 - 2x2 + 5x3 = 2
-x1 - 4x2 + x3 = 3
This system of equations has