Register

Trees

297 views
1 votes
1 votes
StateTrue/False:

Conversion of Max heap into a binary search tree takes O(n) time.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Ujjaval251 asked Mar 14, 2023
981 views
Practice question Avl trees
S1 : An insertion in an AVL with n nodes requires O(n) rotations. answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n). tell me if i am wrong and correct me please.
S1 : An insertion in an AVL with n nodes requires O(n) rotations.answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n).tell me if i ...
User Avatar
1 votes
1 votes
0 answers
2
Chaitanya Kale asked Oct 9, 2022
407 views
AVL Trees
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
User Avatar
0 votes
0 votes
0 answers
3
teja1521 asked Feb 18, 2019
266 views
how to generalize the number of trees intersection between preorder and postorder
User Avatar
0 votes
0 votes
1 answer
4
Ashwani Yadav asked Jan 1, 2019
556 views
Binary search trees
the number of binary search trees with 4 nodes (1 , 2 , 3 , 4) where 1 is always a leaf node?
the number of binary search trees with 4 nodes (1 , 2 , 3 , 4) where 1 is always a leaf node?
User Avatar
Link Copied!