Q121
Open questionWhich of the following trees is similar to that of an AA-Tree?
Select an option to see the answer and solution.
Data Structure · all questionsBinary Search Trees(B Tree)
Binary Search Trees(B Tree)
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
275
Questions
7/14
Page
Pick an option on a question to see the right answer and solution.
Q122
Open questionWhat must be the missing logic below so as to print mirror of a tree as below as an example?
if(rootnode):
mirror(rootnode-->left)
mirror(rootnode-->right)
//missing
endSelect an option to see the answer and solution.
Q123
Open questionWhat is the maximum number of children that a binary tree node can have?
Select an option to see the answer and solution.
Q124
Open questionIs partitioning method used by Tango Tree.
Select an option to see the answer and solution.
Q125
Open questionFor the tree below, write the pre-order traversal.
Select an option to see the answer and solution.
Q126
Open questionWhat is the time complexity for creating a new node and then performing concatenation in the rope data structure?
Select an option to see the answer and solution.
Q127
Open questionWhat is the time complexity of level order traversal?
Select an option to see the answer and solution.
Q128
Open questionIf the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array?
Select an option to see the answer and solution.
Q129
Open questionSelf - balancing binary search trees have a much better average-case time complexity than hash tables.
Select an option to see the answer and solution.
Q130
Open questionWhat are null nodes filled with in a threaded binary tree?
Select an option to see the answer and solution.
Q131
Open questionWhy do we impose restrictions like
. root property is black
. every leaf is black
. children of red node are black
. all leaves have same black
. root property is black
. every leaf is black
. children of red node are black
. all leaves have same black
Select an option to see the answer and solution.
Q132
Open questionWhat is the maximum height of an AVL tree with p nodes?
Select an option to see the answer and solution.
Q133
Open questionThe maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is . . . . . . . .
Select an option to see the answer and solution.
Q134
Open questionFigure below is a balanced binary tree. If a node inserted as child of the node R, how many nodes will become unbalanced?
Select an option to see the answer and solution.
Q135
Open questionIn a full binary tree if there are L leaves, then total number of nodes N are?
Select an option to see the answer and solution.
Q136
Open questionWhy the below pseudo code where x is a value, wt is weight factor and t is root node can't insert?
WeightBalanceTreeNode insert(int x, int wt, WeightBalanceTreeNode k) :
if (k == null)
k = new WeightBalanceTreeNode(x, wt, null, null)
else if (x < t.element) :
k.left = insert (x, wt, k.left)
if (k.left.weight < k.weight)
k = rotateWithRightChild (k)
else if (x > t.element) :
k.right = insert (x, wt, k.right)
if (k.right.weight < k.weight)
k = rotateWithLeftChild (k)Select an option to see the answer and solution.
Q137
Open questionCan a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
Select an option to see the answer and solution.
Q138
Open questionIs it true that splay trees have O(logn) amortized complexity ?
Select an option to see the answer and solution.
Q139
Open questionWhat is the space complexity of a treap algorithm?
Select an option to see the answer and solution.
Q140
Open questionWhy we need to a binary tree which is height balanced?
Select an option to see the answer and solution.