Data Structure · all questions

Binary Search Trees(B Tree)
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

275

Questions

8/14

Page

Pick an option on a question to see the right answer and solution.

Q141

For the tree below, write the level-order traversal.

Binary Search Trees(B Tree) mcq question image

Select an option to see the answer and solution.

Q142

When it would be optimal to prefer Red-black trees over AVL trees?

Select an option to see the answer and solution.

Q143

What is the disadvantage of using splay trees?

Select an option to see the answer and solution.

Q144

After which city is tango tree named?

Select an option to see the answer and solution.

Q145

Is it possible to perform a split operation on a string in the rope if the split point is in the middle of the string.

Select an option to see the answer and solution.

Q146

What is the average running time of a treap?

Select an option to see the answer and solution.

Q147

What is the time complexity for maintaining a dynamic set of weighted trees?

Select an option to see the answer and solution.

Q148

Consider below sequences.

array=60 90 10 100 40 150 90
reverse 2 to 3
array=60 10 90 100 40 150 90
reverse 3 to 6
array= 60 100 150 40 100 90 90
  now printout from 1 to 6 :-- 60 100 150 40 100 90

How to achieve the above operation efficiently?

Select an option to see the answer and solution.

Q149

In the given figure, find '?'.

Binary Search Trees(B Tree) mcq question image

Select an option to see the answer and solution.

Q150

What may be the psuedo code for finding the size of a tree?

Select an option to see the answer and solution.

Q151

Which of the below diagram is following AVL tree property?

Binary Search Trees(B Tree) mcq question image

Select an option to see the answer and solution.

Q152

Is mathematical randomized tree can be generated using beta distribution.

Select an option to see the answer and solution.

Q153

The minimum height of self balancing binary search tree with n nodes is . . . . . . . .

Select an option to see the answer and solution.

Q154

What is a threaded binary tree traversal?

Select an option to see the answer and solution.

Q155

In a full binary tree if number of internal nodes is I, then number of nodes N are?

Select an option to see the answer and solution.

Q156

What should be the condition for the level of a left node?

Select an option to see the answer and solution.

Q157

Is tango tree represented as a tree of trees.

Select an option to see the answer and solution.

Q158

Consider the pseudo code:

int avl(binarysearchtree root):
   if(not root)
     return 0
   left_tree_height = avl(left_of_root)
 
   if(left_tree_height== -1) 
     return left_tree_height
 
   right_tree_height= avl(right_of_root)
 
   if(right_tree_height==-1)
     return right_tree_height

Does the above code can check if a binary search tree is an AVL tree?

Select an option to see the answer and solution.

Q159

Who invented treaps?

Select an option to see the answer and solution.

Q160

Which of the following data structures can be efficiently implemented using height balanced binary search tree?

Select an option to see the answer and solution.

Prev 6 7 8 9 10 Next