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
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
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
140
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
(
13.6k
points)

140
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
0
votes
0
answers
1
Binary Tree Doubt
( Its a doubt so dont mark it as duplicate ) https://gateoverflow.in/1776/gate2014112?show=27673#a27673 In the above answer, if I ignored all the ancestors of current node with subtree node count exact 4 as they surely will not have exact 4 count. ( they ... So ignoring such ancestors , can I reduce the time complexity ? or it will still be O(n) only ? Please explain. Question :
asked
Nov 11
in
Programming
by
HeadShot
Active
(
3.3k
points)

22
views
+1
vote
1
answer
2
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
(
923
points)

107
views
datastructure
binarytree
0
votes
2
answers
3
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)

166
views
nary
tree
0
votes
0
answers
4
doubt AVL TREE
asked
Dec 4
in
Algorithms
by
neerajyadav
(
171
points)

41
views
0
votes
2
answers
5
B+ Tree Self Doubt
what is the minimum and maximum number of keys for nonleaf nodes and leaf nodes for B+ Tree of order p?
asked
Nov 23
in
Databases
by
aditi19
Active
(
2k
points)

50
views
btree
databases
indexing
multilevel
0
votes
0
answers
6
B tree Doubt
https://gateoverflow.in/3723/gate2004it79 In the above question why record pointer is considered in internal node size calculation?
asked
Nov 16
in
Databases
by
Shamim Ahmed
Junior
(
947
points)

20
views
btree
databases
0
votes
0
answers
7
B+ Tree Doubt
Why internal node split isn't counted in this question? Only leaf node split is counted. https://gateoverflow.in/1330/gate200944
asked
Nov 16
in
Databases
by
Shamim Ahmed
Junior
(
947
points)

21
views
btree
databases
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
IIT HYDERABAD M.Tech (RA) 3Years Winter Session Interview experience
INDIAN AIR FORCE
GATE BOOK _ TEST SERIES DOUBT_
Visualizing complex C code
GATE Book Test Series
All categories
General Aptitude
1.4k
Engineering Mathematics
6.5k
Digital Logic
2.5k
Programming & DS
4.5k
Programming
3.3k
DS
1.2k
Algorithms
3.9k
Theory of Computation
5k
Compiler Design
1.9k
Operating System
3.7k
Databases
3.7k
CO & Architecture
3.2k
Computer Networks
3.7k
Non GATE
1.2k
Others
1.3k
Admissions
512
Exam Queries
501
Tier 1 Placement Questions
23
Job Queries
66
Projects
18
Follow @csegate
Gatecse
Recent Blog Comments
thankyou sir
@
44,071
questions
49,594
answers
162,952
comments
65,786
users