Askmeabout

Lets share our knowledge

Q & A

Q & A › Category: Data Structure
Filter:AllOpenResolvedClosedUnanswered
The time complexity of the code that determines the number of inversions in an array using merge sort is lesser than that of the code that uses loops for the same purpose.
AnsweredAdmin asked 4 years ago • 
58 views1 answers0 votes
AVL trees are more balanced than Red-black trees.
AnsweredAdmin asked 4 years ago • 
68 views1 answers0 votes
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.
AnsweredAdmin asked 4 years ago • 
127 views1 answers0 votes
Which of the following data structures can be efficiently implemented using height balanced binary search tree?
AnsweredAdmin asked 4 years ago • 
102 views1 answers0 votes
Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.
AnsweredAdmin asked 4 years ago • 
75 views1 answers0 votes
Which of the following tree data structures is not a balanced binary tree?
AnsweredAdmin asked 4 years ago • 
98 views1 answers-1 votes
A binary tree is balanced if the difference between left and right subtree of every node is not more than ____
AnsweredAdmin asked 4 years ago • 
102 views1 answers-1 votes
The balance factor of a node in a binary tree is defined as _____
AnsweredAdmin asked 4 years ago • 
154 views1 answers0 votes
What will be the height of a balanced full binary tree with 8 leaves?
AnsweredAdmin asked 4 years ago • 
99 views1 answers0 votes
What are the conditions for an optimal binary search tree and what is its advantage?
AnsweredAdmin asked 4 years ago • 
385 views1 answers0 votes
What are the worst case and average case complexities of a binary search tree?
AnsweredAdmin asked 4 years ago • 
98 views1 answers-1 votes
What is the speciality about the inorder traversal of a binary search tree?
AnsweredAdmin asked 4 years ago • 
243 views1 answers-5 votes
In a full binary tree if there are L leaves, then total number of nodes N are?
AnsweredAdmin asked 4 years ago • 
191 views1 answers0 votes
In a full binary tree if number of internal nodes is I, then number of nodes N are?
AnsweredAdmin asked 4 years ago • 
79 views1 answers-1 votes
In a full binary tree if number of internal nodes is I, then number of leaves L are?
AnsweredAdmin asked 4 years ago • 
130 views1 answers0 votes
123…20
Ask Question