in Programming in C closed by
934 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   
 

in Programming in C closed by
934 views

2 Comments

B)  -- I used hit and trial
0
0
Your question is duplicate of this one-- https://gateoverflow.in/842/gate2002-2-12
0
0

Related questions

1 vote
1 vote
0 answers
3