Register

Trees

137 views
0 votes
0 votes
Time complexity of creating a balanced binary search tree as well as unbalanced search tree from inorder traversal and preorder traversals?
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
979 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
Mayankprakash asked Nov 2, 2018
497 views
AVL TREES
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpful Thanks
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpfulThanks
User Avatar
0 votes
0 votes
1 answer
4
once_2019 asked Jun 24, 2018
631 views
trees data structure
Is the root node an internal node?
Is the root node an internal node?
User Avatar
Link Copied!