The Gateway to Computer Science Excellence
0 votes
39 views
A weight balanced tree is a binary tree in which for each node, the no. of nodes in the left sub tree is atleast half and at most twice the no. of nodes in the right sub tree. The maximum possible height of such a tree with n nodes is best described by which of the following?
(a) log2 n                        (b) log4/3 n
(c) log3 n                        (d) log3/2 n
closed as a duplicate of: GATE2002-2.12
in DS by (421 points)
closed by | 39 views

Related questions

0 votes
0 answers
3
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,297 answers
198,265 comments
104,977 users