Question: 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
Options
A : log2 n
B : log4/3 n
C : log3 n
D : log3/2 n
Data Structure Weight Balanced Tree more questions
Which of the following transformations is particularly well suited for....
What maximum difference in heights between the leafs of a....
Which of the given function is a library function under....
Transform 54y = n+1 into equivalent a logarithmic expression.
Which of the following transforms can be performed with data....
How many complex multiplications are need to be performed to....
Which of the following works by increasing the dynamic range?
In Homomorphic filtering which of the following operations is used....
The shape of the cam to transmit uniform linear motion....
Data Structure Adjacency List more Online Exam Quiz
Data Structure Undirected Graph
Data Structure Uniform Binary Search
Data Structure Wagner Fischer Algorithm
Data Structure Xor Linked List
Dc Machines Applications Dc Machines