closed by
957 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2002 | Question: 2.12

 

A weight-balanced tree is a binary tree in which for each node. 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 n nodes is best described by which of the following?

a) \log_2 n b) \log_{4/3} nc) \log_3 n d) \log_{3/2} n


Binary Trees   
 

closed by

Related questions

0 votes
0 votes
0 answers
1
ayush201 asked Dec 7, 2018
1,093 views
Q.47. How many minimum relation tables are required which satisfy 1NF? A 2, 2, and 1 respectivelyB 2, 2, and 2 respectivelyC 1, 2, and 1 respectivelyD 1, 1, and 1 respect...
0 votes
0 votes
0 answers
2
1 votes
1 votes
0 answers
3
0 votes
0 votes
1 answer
4