The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook 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
Trees
+1
vote
73
views
StateTrue/False:
Conversion of Max heap into a binary search tree takes O(n) time.
asked
Feb 11, 2019
in
Programming
by
gate_forum
Junior
(
867
points)

73
views
answer
comment
+1
https://stackoverflow.com/questions/14106821/convertingaheaptoabstinontime
0
why bother having nlog(n) algorithm then?
0
False :takes nlogn time
1. delete elements in max heap that gives ascending order and inorder of BST is ascending order , so converted into bst.
2. given array elements sort them in ascending order is also BST
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
0
answers
1
how to generalize the number of trees intersection between preorder and postorder
asked
Feb 18, 2019
in
Programming
by
teja1521
(
183
points)

22
views
0
votes
1
answer
2
Binary search trees
the number of binary search trees with 4 nodes (1 , 2 , 3 , 4) where 1 is always a leaf node?
asked
Jan 1, 2019
in
Programming
by
Ashwani Yadav
Active
(
1.2k
points)

74
views
binarysearchtree
0
votes
0
answers
3
Trees
Time complexity of creating a balanced binary search tree as well as unbalanced search tree from inorder traversal and preorder traversals?
asked
Jan 1, 2019
in
Programming
by
Mudita
(
23
points)

30
views
datastructures
0
votes
0
answers
4
https://www.geeksforgeeks.org/datastructuregq/binarytreesgq/
A weightbalanced 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 ... ) of such a tree on n nodes is best described by which of the following? a) b) c) d) Binary Trees
asked
Dec 30, 2018
in
Programming
by
ayush201
(
33
points)

112
views
binarytree
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Digital Logic
2.9k
Programming and DS
4.9k
Programming
3.5k
DS
1.3k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.4k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
@saransh0 ...... I am getting 108... is there any...
Yes you are through! Prepare for Interview
Guys do you think I have a chance? I am getting...
And there is some question like where they...
Yes post order question is also wrong.....
50,737
questions
57,390
answers
198,589
comments
105,443
users