The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Tree Doubt
+1
vote
128
views
For a binary tree T with n vertices with n vertices,show tat the minimum possible height is logbase2(n+1)1.Plz give the mathematical proof for it.
asked
Jul 3, 2016
in
Programming
by
Devshree Dubey
Boss
(
12.3k
points)

128
views
Facebook
Google+
Twitter
answer
comment
0
http://cs.stackexchange.com/questions/6277/whyistheminimumheightofabinarytreelog2n11
0
Thanx. This explanation is kind of okay!!!. :). Partially satisfied though not wholly. :)
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+1
vote
1
answer
1
Binary tree doubt
Q Consider a complete Binary Tree ‘T’ with key of root node be ‘P’. It is given that the left and right subtree of ‘P’ satisfies minheap property. What is the time taken to convert the given tree ‘T’ to a max heap ? 1.O(log n) 2.O(n) 3. O(n log n) 4.Ο(n2)
asked
Aug 8, 2017
in
Programming
by
kallu singh
Junior
(
783
points)

98
views
datastructure
binarytree
0
votes
2
answers
2
data structure tree doubt
A 5ary tree is a tree in which every internal node has 3 children.The number of leaf nodes in such a tree with 10 internal nodes is______
asked
Jan 24, 2017
in
Programming
by
iita
Active
(
1.5k
points)

134
views
nary
tree
0
votes
1
answer
3
Doubt regarding deletion from a Btree
After deleting an element from a Btree,I could rearrange the tree in several ways,that would still complies to the rules of Btrees.But,we are supposed to follow a certain set of rules for rearranging the tree after deleting an element. Why is that ?
asked
Mar 1
in
Algorithms
by
Mathews George
(
15
points)

75
views
btree
datastructure
trees
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
Recent Posts
My failure, Oh wait SUCCESS journey
ALGORITHMS CHECKLIST:
A Failure who got into IISc
ISRO written test results are out!!
UGC NET 2018 Admit Card available for Download
All categories
General Aptitude
1.3k
Engineering Mathematics
5.2k
Digital Logic
2k
Programming & DS
3.7k
Programming
2.7k
DS
991
Algorithms
3.2k
Theory of Computation
4k
Compiler Design
1.6k
Operating System
2.8k
Databases
3k
CO & Architecture
2.6k
Computer Networks
3k
Non GATE
1k
Others
1.3k
Admissions
486
Exam Queries
435
Tier 1 Placement Questions
18
Job Queries
56
Projects
9
Follow @csegate
Gatecse
Recent Blog Comments
Thank you sir
Thank you so much sir
Awesome!! It is pretty difficult to imagine how ...
Congrats :)
Next week everyone should get the address ...
36,171
questions
43,624
answers
124,024
comments
42,893
users